Base | Representation |
---|---|
bin | 1010000000111110111100… |
… | …0100011111010010010101 |
3 | 1102222201221001120010211022 |
4 | 2200033233010133102111 |
5 | 2420410100100022442 |
6 | 35230503140450525 |
7 | 2214406632351152 |
oct | 240175704372225 |
9 | 42881831503738 |
10 | 11012012110997 |
11 | 3566193832777 |
12 | 129a2506a9a45 |
13 | 61b574c39241 |
14 | 2a0daca27229 |
15 | 1416ab01d3d2 |
hex | a03ef11f495 |
11012012110997 has 2 divisors, whose sum is σ = 11012012110998. Its totient is φ = 11012012110996.
The previous prime is 11012012110901. The next prime is 11012012111021. The reversal of 11012012110997 is 79901121021011.
11012012110997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9884478193681 + 1127533917316 = 3143959^2 + 1061854^2 .
It is an emirp because it is prime and its reverse (79901121021011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11012012110997 - 28 = 11012012110741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012032110997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506006055498 + 5506006055499.
It is an arithmetic number, because the mean of its divisors is an integer number (5506006055499).
Almost surely, 211012012110997 is an apocalyptic number.
It is an amenable number.
11012012110997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012012110997 is an equidigital number, since it uses as much as digits as its factorization.
11012012110997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 35.
The spelling of 11012012110997 in words is "eleven trillion, twelve billion, twelve million, one hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •