Base | Representation |
---|---|
bin | 11110101110000010001… |
… | …000100000100101000101 |
3 | 21110210220001220110210221 |
4 | 132232002020200211011 |
5 | 234041323111223023 |
6 | 4253441405544341 |
7 | 305341564505026 |
oct | 36560210404505 |
9 | 7423801813727 |
10 | 2111012211013 |
11 | 7443033a5022 |
12 | 2a11658750b1 |
13 | 1240b56854b4 |
14 | 7426027cc4d |
15 | 39da3db985d |
hex | 1eb82220945 |
2111012211013 has 2 divisors, whose sum is σ = 2111012211014. Its totient is φ = 2111012211012.
The previous prime is 2111012211001. The next prime is 2111012211029. The reversal of 2111012211013 is 3101122101112.
It is a happy number.
It is an a-pointer prime, because the next prime (2111012211029) can be obtained adding 2111012211013 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1780711431489 + 330300779524 = 1334433^2 + 574718^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2111012211013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111012211313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055506105506 + 1055506105507.
It is an arithmetic number, because the mean of its divisors is an integer number (1055506105507).
Almost surely, 22111012211013 is an apocalyptic number.
It is an amenable number.
2111012211013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111012211013 is an equidigital number, since it uses as much as digits as its factorization.
2111012211013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 2111012211013 its reverse (3101122101112), we get a palindrome (5212134312125).
The spelling of 2111012211013 in words is "two trillion, one hundred eleven billion, twelve million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •