Base | Representation |
---|---|
bin | 10111001100010010111010… |
… | …011111010010110101101011 |
3 | 111101011002212012221200201011 |
4 | 113030102322133102311223 |
5 | 101332132011100024321 |
6 | 1000534054135204351 |
7 | 30325154246452054 |
oct | 2714227237226553 |
9 | 441132765850634 |
10 | 102000012111211 |
11 | 2a555a6477a325 |
12 | b5343518166b7 |
13 | 44bb73805aac6 |
14 | 1b28b8113572b |
15 | bbd3c3890ae1 |
hex | 5cc4ba7d2d6b |
102000012111211 has 8 divisors (see below), whose sum is σ = 102080235298304. Its totient is φ = 101919800926440.
The previous prime is 102000012111209. The next prime is 102000012111271. The reversal of 102000012111211 is 112111210000201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102000012111211 - 21 = 102000012111209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102000012111191 and 102000012111200.
It is not an unprimeable number, because it can be changed into a prime (102000012111271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14040850 + ... + 20028616.
It is an arithmetic number, because the mean of its divisors is an integer number (12760029412288).
Almost surely, 2102000012111211 is an apocalyptic number.
102000012111211 is a deficient number, since it is larger than the sum of its proper divisors (80223187093).
102000012111211 is a wasteful number, since it uses less digits than its factorization.
102000012111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6001161.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102000012111211 its reverse (112111210000201), we get a palindrome (214111222111412).
The spelling of 102000012111211 in words is "one hundred two trillion, twelve million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •