Base | Representation |
---|---|
bin | 10111001100010011110111… |
… | …010010010101001011110001 |
3 | 111101011012111022021200000001 |
4 | 113030103313102111023301 |
5 | 101332141103210414441 |
6 | 1000534343253430001 |
7 | 30325221443431525 |
oct | 2714236722251361 |
9 | 441135438250001 |
10 | 102001032123121 |
11 | 2a55643852137a |
12 | b53459733b301 |
13 | 44bb86b483951 |
14 | 1b28c3a7b1d85 |
15 | bbd4331c6731 |
hex | 5cc4f74952f1 |
102001032123121 has 2 divisors, whose sum is σ = 102001032123122. Its totient is φ = 102001032123120.
The previous prime is 102001032123079. The next prime is 102001032123161. The reversal of 102001032123121 is 121321230100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82572860215521 + 19428171907600 = 9086961^2 + 4407740^2 .
It is an emirp because it is prime and its reverse (121321230100201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102001032123121 - 217 = 102001031992049 is a prime.
It is not a weakly prime, because it can be changed into another prime (102001032123161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000516061560 + 51000516061561.
It is an arithmetic number, because the mean of its divisors is an integer number (51000516061561).
Almost surely, 2102001032123121 is an apocalyptic number.
It is an amenable number.
102001032123121 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001032123121 is an equidigital number, since it uses as much as digits as its factorization.
102001032123121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 102001032123121 its reverse (121321230100201), we get a palindrome (223322262223322).
The spelling of 102001032123121 in words is "one hundred two trillion, one billion, thirty-two million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •