Base | Representation |
---|---|
bin | 11011010011111111011001… |
… | …100110011100001110110011 |
3 | 120202022110022002200210202111 |
4 | 123103333121212130032303 |
5 | 111221030302240201321 |
6 | 1103250454234230151 |
7 | 34205312246442106 |
oct | 3323773146341663 |
9 | 522273262623674 |
10 | 120121001100211 |
11 | 35302037633781 |
12 | 11580308285357 |
13 | 5204491b47c17 |
14 | 2193c5d32c73d |
15 | dd49524585e1 |
hex | 6d3fd999c3b3 |
120121001100211 has 2 divisors, whose sum is σ = 120121001100212. Its totient is φ = 120121001100210.
The previous prime is 120121001100193. The next prime is 120121001100301. The reversal of 120121001100211 is 112001100121021.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120121001100211 - 227 = 120120866882483 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120121001100191 and 120121001100200.
It is not a weakly prime, because it can be changed into another prime (120121001100311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60060500550105 + 60060500550106.
It is an arithmetic number, because the mean of its divisors is an integer number (60060500550106).
Almost surely, 2120121001100211 is an apocalyptic number.
120121001100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
120121001100211 is an equidigital number, since it uses as much as digits as its factorization.
120121001100211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 120121001100211 its reverse (112001100121021), we get a palindrome (232122101221232).
The spelling of 120121001100211 in words is "one hundred twenty trillion, one hundred twenty-one billion, one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •