Base | Representation |
---|---|
bin | 10111001101110001111010… |
… | …001001111111011100001011 |
3 | 111101111212010202201220122102 |
4 | 113031301322021333130023 |
5 | 101340314410033000021 |
6 | 1001053003342544015 |
7 | 30335425016300132 |
oct | 2715617211773413 |
9 | 441455122656572 |
10 | 102102012000011 |
11 | 2a595246a86491 |
12 | b55007929800b |
13 | 44c8241ca60aa |
14 | 1b2da99a22919 |
15 | bc0d9346a00b |
hex | 5cdc7a27f70b |
102102012000011 has 8 divisors (see below), whose sum is σ = 108108204224400. Its totient is φ = 96095841055488.
The previous prime is 102102011999993. The next prime is 102102012000059. The reversal of 102102012000011 is 110000210201201.
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 102102012000011 - 242 = 97703965488907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102102011999956 and 102102012000001.
It is not an unprimeable number, because it can be changed into a prime (102102012000211) 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, 5146775 + ... + 15188591.
It is an arithmetic number, because the mean of its divisors is an integer number (13513525528050).
Almost surely, 2102102012000011 is an apocalyptic number.
102102012000011 is a deficient number, since it is larger than the sum of its proper divisors (6006192224389).
102102012000011 is a wasteful number, since it uses less digits than its factorization.
102102012000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10639933.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102102012000011 its reverse (110000210201201), we get a palindrome (212102222201212).
The spelling of 102102012000011 in words is "one hundred two trillion, one hundred two billion, twelve million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •