Base | Representation |
---|---|
bin | 10111001111010110100101… |
… | …011011100100100100001011 |
3 | 111101220012011110100121201100 |
4 | 113033112211123210210023 |
5 | 101344102302211224321 |
6 | 1001214402145352443 |
7 | 30346302602030544 |
oct | 2717264533444413 |
9 | 441805143317640 |
10 | 102210112211211 |
11 | 2a627079805104 |
12 | b569007938723 |
13 | 45054aba145c4 |
14 | 1b34dd27954cb |
15 | bc3abd897326 |
hex | 5cf5a56e490b |
102210112211211 has 12 divisors (see below), whose sum is σ = 148991295069760. Its totient is φ = 67514936505840.
The previous prime is 102210112211203. The next prime is 102210112211257. The reversal of 102210112211211 is 112112211012201.
It is a happy number.
102210112211211 is a `hidden beast` number, since 1 + 0 + 221 + 0 + 11 + 221 + 1 + 211 = 666.
It is not a de Polignac number, because 102210112211211 - 23 = 102210112211203 is a prime.
It is a super-3 number, since 3×1022101122112113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102210112211111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52094857435 + ... + 52094859396.
Almost surely, 2102210112211211 is an apocalyptic number.
102210112211211 is a deficient number, since it is larger than the sum of its proper divisors (46781182858549).
102210112211211 is a wasteful number, since it uses less digits than its factorization.
102210112211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104189716946 (or 104189716943 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 102210112211211 its reverse (112112211012201), we get a palindrome (214322323223412).
The spelling of 102210112211211 in words is "one hundred two trillion, two hundred ten billion, one hundred twelve million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •