Base | Representation |
---|---|
bin | 10111001101110001111010… |
… | …000010010111101001100101 |
3 | 111101111212010121222101220210 |
4 | 113031301322002113221211 |
5 | 101340314404030031041 |
6 | 1001053003232050033 |
7 | 30335424663306111 |
oct | 2715617202275145 |
9 | 441455117871823 |
10 | 102102010002021 |
11 | 2a595245941357 |
12 | b550078693919 |
13 | 44c8241756853 |
14 | 1b2da99662741 |
15 | bc0d931c3016 |
hex | 5cdc7a097a65 |
102102010002021 has 8 divisors (see below), whose sum is σ = 136137156861600. Its totient is φ = 68067434905232.
The previous prime is 102102010001993. The next prime is 102102010002073. The reversal of 102102010002021 is 120200010201201.
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 102102010002021 - 25 = 102102010001989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102102010001988 and 102102010002006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102010000021) 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, 142523850 + ... + 143238443.
It is an arithmetic number, because the mean of its divisors is an integer number (17017144607700).
Almost surely, 2102102010002021 is an apocalyptic number.
It is an amenable number.
102102010002021 is a deficient number, since it is larger than the sum of its proper divisors (34035146859579).
102102010002021 is a wasteful number, since it uses less digits than its factorization.
102102010002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285881395.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102102010002021 its reverse (120200010201201), we get a palindrome (222302020203222).
The spelling of 102102010002021 in words is "one hundred two trillion, one hundred two billion, ten million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •