Base | Representation |
---|---|
bin | 101111101001001000… |
… | …1110000111100111001 |
3 | 100210002022022012210021 |
4 | 1133102101300330321 |
5 | 3134013400320441 |
6 | 115000155450441 |
7 | 10251250446331 |
oct | 1372221607471 |
9 | 323068265707 |
10 | 102312120121 |
11 | 3a432585182 |
12 | 179b4156a21 |
13 | 9856839463 |
14 | 4d481660c1 |
15 | 29dc2023d1 |
hex | 17d2470f39 |
102312120121 has 2 divisors, whose sum is σ = 102312120122. Its totient is φ = 102312120120.
The previous prime is 102312120109. The next prime is 102312120137. The reversal of 102312120121 is 121021213201.
It is an a-pointer prime, because the next prime (102312120137) can be obtained adding 102312120121 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95582378896 + 6729741225 = 309164^2 + 82035^2 .
It is a cyclic number.
It is not a de Polignac number, because 102312120121 - 229 = 101775249209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102312120095 and 102312120104.
It is not a weakly prime, because it can be changed into another prime (102312127121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51156060060 + 51156060061.
It is an arithmetic number, because the mean of its divisors is an integer number (51156060061).
Almost surely, 2102312120121 is an apocalyptic number.
It is an amenable number.
102312120121 is a deficient number, since it is larger than the sum of its proper divisors (1).
102312120121 is an equidigital number, since it uses as much as digits as its factorization.
102312120121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102312120121 its reverse (121021213201), we get a palindrome (223333333322).
The spelling of 102312120121 in words is "one hundred two billion, three hundred twelve million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •