Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …111101011001011110111111 |
3 | 111101111122222101210001121211 |
4 | 113031300002331121132333 |
5 | 101340301311111210421 |
6 | 1001052033104305251 |
7 | 30335324324331646 |
oct | 2715600275313677 |
9 | 441448871701554 |
10 | 102100012210111 |
11 | 2a594410172763 |
12 | b54b7bb612227 |
13 | 44c7cb38a3566 |
14 | 1b2d94a1c035d |
15 | bc0cc7ae99e1 |
hex | 5cdc02f597bf |
102100012210111 has 12 divisors (see below), whose sum is σ = 113010510578112. Its totient is φ = 91916123516096.
The previous prime is 102100012210051. The next prime is 102100012210271. The reversal of 102100012210111 is 111012210001201.
It is a happy number.
It is not a de Polignac number, because 102100012210111 - 215 = 102100012177343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102100012210091 and 102100012210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100072210111) 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, 5676629071 + ... + 5676647056.
It is an arithmetic number, because the mean of its divisors is an integer number (9417542548176).
Almost surely, 2102100012210111 is an apocalyptic number.
102100012210111 is a deficient number, since it is larger than the sum of its proper divisors (10910498368001).
102100012210111 is a wasteful number, since it uses less digits than its factorization.
102100012210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11353276190 (or 11353276167 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102100012210111 its reverse (111012210001201), we get a palindrome (213112222211312).
The spelling of 102100012210111 in words is "one hundred two trillion, one hundred billion, twelve million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •