Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …011001010101111111111001 |
3 | 111101120120120110120222000011 |
4 | 113032002222121111333321 |
5 | 101341113230301400441 |
6 | 1001105140401541521 |
7 | 30336632554051522 |
oct | 2716025231257771 |
9 | 441516513528004 |
10 | 102120001200121 |
11 | 2a5a1938461813 |
12 | b5536599448a1 |
13 | 44c9b4abc49b8 |
14 | 1b308c4c3b849 |
15 | bc15978dd581 |
hex | 5ce0aa655ff9 |
102120001200121 has 2 divisors, whose sum is σ = 102120001200122. Its totient is φ = 102120001200120.
The previous prime is 102120001200109. The next prime is 102120001200137. The reversal of 102120001200121 is 121002100021201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72498498306025 + 29621502894096 = 8514605^2 + 5442564^2 .
It is a cyclic number.
It is not a de Polignac number, because 102120001200121 - 233 = 102111411265529 is a prime.
It is a super-2 number, since 2×1021200012001212 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102120001200821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51060000600060 + 51060000600061.
It is an arithmetic number, because the mean of its divisors is an integer number (51060000600061).
Almost surely, 2102120001200121 is an apocalyptic number.
It is an amenable number.
102120001200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
102120001200121 is an equidigital number, since it uses as much as digits as its factorization.
102120001200121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102120001200121 its reverse (121002100021201), we get a palindrome (223122101221322).
The spelling of 102120001200121 in words is "one hundred two trillion, one hundred twenty billion, one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •