Base | Representation |
---|---|
bin | 10111001100010010111001… |
… | …111001100110101011101101 |
3 | 111101011002211112100201122012 |
4 | 113030102321321212223231 |
5 | 101332132001032343041 |
6 | 1000534053143331005 |
7 | 30325154066461616 |
oct | 2714227171465355 |
9 | 441132745321565 |
10 | 102000002231021 |
11 | 2a555a5a141184 |
12 | b53434a450a65 |
13 | 44bb735cab93b |
14 | 1b28b7dac2c0d |
15 | bbd3c2a8d3eb |
hex | 5cc4b9e66aed |
102000002231021 has 16 divisors (see below), whose sum is σ = 102422476062720. Its totient is φ = 101578494386160.
The previous prime is 102000002231009. The next prime is 102000002231027. The reversal of 102000002231021 is 120132200000201.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102000002231021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102000002230987 and 102000002231005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000002231027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 854505140 + ... + 854624498.
It is an arithmetic number, because the mean of its divisors is an integer number (6401404753920).
Almost surely, 2102000002231021 is an apocalyptic number.
It is an amenable number.
102000002231021 is a deficient number, since it is larger than the sum of its proper divisors (422473831699).
102000002231021 is a wasteful number, since it uses less digits than its factorization.
102000002231021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123376.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 102000002231021 its reverse (120132200000201), we get a palindrome (222132202231222).
The spelling of 102000002231021 in words is "one hundred two trillion, two million, two hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •