11015 is the number following 11014 and preceding 11016.
Properties[]
- Its factors are 1, 5, 2203 and 11015, making it a composite number.[1][2][3] It is also a squarefree number.[4]
- 11015 is an odd number[5][6] .
- 11015 is a happy number.[7][8]
- 11015 is deficient.[9]
- Its prime factorization is 51 × 22031.
Approximations[]
| Notation | Lower bound | Upper bound | |
|---|---|---|---|
| Up-arrow notation | 105 ↑ 2 | ||
| Scientific notation | 1.102 x 104 | 1.103 x 104 | |
| Slow-growing hierarchy | \(g_{\omega^{\omega}}(5)\) | \(g_{\omega^{\omega}}(6)\) | |
| Copy notation | 9[4] | 1[5] | |
| Chained arrow notation | 105 → 2 | ||
| Bowers' Exploding Array Function/Bird's array notation | {105,2} | ||
| Fast-growing hierarchy | f2(10) | f2(11) | |
| Hardy hierarchy | Hω(5507) | Hω(5508) | |
| Middle-growing hierarchy | m(ω,13) | m(ω,14) | |
| Hyper-E notation | E4.042 | ||
| Hyper-E notation (non-10 base) | \(E[105]2\) | ||
| Hyperfactorial array notation | 7! | 8! | |
| X-Sequence Hyper-Exponential Notation | 105{1}2 | ||
| Steinhaus-Moser Notation | 5[3] | 6[3] | |
| PlantStar's Debut Notation | [2] | [3] | |
| H* function | H(0.3) | H(0.4) | |
| Bashicu matrix system with respect to version 4 | (0)[104] | (0)[105] | |
| m(n) map | m(1)(5) | m(1)(6) | |
| s(n) map | \(s(1)(\lambda x . x+1)(5506)\) | \(s(1)(\lambda x . x+1)(5507)\) | |
Sources[]
- ↑ OEIS A002808 - Composite numbers
- ↑ Wolfram Alpha Is 11015 composite?
- ↑ Wolfram Alpha 11015's factors
- ↑ OEIS A005117 - Squarefree numbers
- ↑ OEIS A005408 - Odd numbers
- ↑ Wolfram Alpha Is 11015 odd?
- ↑ Wolfram Alpha Happy Numbers
- ↑ OEIS A007770 - Happy Numbers
- ↑ OEIS A005100 - Deficient numbers