Base | Representation |
---|---|
bin | 11011010011111111100110… |
… | …001011010101110110111011 |
3 | 120202022110211210201201002111 |
4 | 123103333212023111312323 |
5 | 111221031220244200102 |
6 | 1103250531212513151 |
7 | 34205320421061655 |
oct | 3323774613256673 |
9 | 522273753651074 |
10 | 120121212100027 |
11 | 35302135749a96 |
12 | 11580366a7b7b7 |
13 | 52044c6783b98 |
14 | 2193c7d3756d5 |
15 | dd4965c36cd7 |
hex | 6d3fe62d5dbb |
120121212100027 has 2 divisors, whose sum is σ = 120121212100028. Its totient is φ = 120121212100026.
The previous prime is 120121212099971. The next prime is 120121212100061. The reversal of 120121212100027 is 720001212121021.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120121212100027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120121212099980 and 120121212100007.
It is not a weakly prime, because it can be changed into another prime (120121212100327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60060606050013 + 60060606050014.
It is an arithmetic number, because the mean of its divisors is an integer number (60060606050014).
Almost surely, 2120121212100027 is an apocalyptic number.
120121212100027 is a deficient number, since it is larger than the sum of its proper divisors (1).
120121212100027 is an equidigital number, since it uses as much as digits as its factorization.
120121212100027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 120121212100027 its reverse (720001212121021), we get a palindrome (840122424221048).
The spelling of 120121212100027 in words is "one hundred twenty trillion, one hundred twenty-one billion, two hundred twelve million, one hundred thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •