Base | Representation |
---|---|
bin | 10111001101110010000000… |
… | …100110101111011101001011 |
3 | 111101111212102022100001010211 |
4 | 113031302000212233131023 |
5 | 101340320120232400021 |
6 | 1001053022210021551 |
7 | 30335430502054051 |
oct | 2715620046573513 |
9 | 441455368301124 |
10 | 102102120200011 |
11 | 2a5952a2068778 |
12 | b5500a95778b7 |
13 | 44c825b52b069 |
14 | 1b2daaa14a1d1 |
15 | bc0d9cbde3e1 |
hex | 5cdc809af74b |
102102120200011 has 8 divisors (see below), whose sum is σ = 102461104432640. Its totient is φ = 101743732784232.
The previous prime is 102102120199999. The next prime is 102102120200053. The reversal of 102102120200011 is 110002021201201.
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 102102120200011 - 235 = 102067760461643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102102120199964 and 102102120200000.
It is not an unprimeable number, because it can be changed into a prime (102102120200071) 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, 148861455 + ... + 149545768.
It is an arithmetic number, because the mean of its divisors is an integer number (12807638054080).
Almost surely, 2102102120200011 is an apocalyptic number.
102102120200011 is a deficient number, since it is larger than the sum of its proper divisors (358984232629).
102102120200011 is an equidigital number, since it uses as much as digits as its factorization.
102102120200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298408425.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102102120200011 its reverse (110002021201201), we get a palindrome (212104141401212).
The spelling of 102102120200011 in words is "one hundred two trillion, one hundred two billion, one hundred twenty million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •