Base | Representation |
---|---|
bin | 11101011101001110001… |
… | …11010000010000000001 |
3 | 10120202110110020120222211 |
4 | 32232213013100100001 |
5 | 113040310434324301 |
6 | 2052543441502121 |
7 | 133060205435056 |
oct | 16564707202001 |
9 | 3522413216884 |
10 | 1012121011201 |
11 | 360268a1a023 |
12 | 1441a5341941 |
13 | 7459a51c611 |
14 | 36db616502d |
15 | 1b4da93c051 |
hex | eba71d0401 |
1012121011201 has 2 divisors, whose sum is σ = 1012121011202. Its totient is φ = 1012121011200.
The previous prime is 1012121011199. The next prime is 1012121011229. The reversal of 1012121011201 is 1021101212101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 814786049025 + 197334962176 = 902655^2 + 444224^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012121011201 - 21 = 1012121011199 is a prime.
Together with 1012121011199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1019121011201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506060505600 + 506060505601.
It is an arithmetic number, because the mean of its divisors is an integer number (506060505601).
Almost surely, 21012121011201 is an apocalyptic number.
It is an amenable number.
1012121011201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012121011201 is an equidigital number, since it uses as much as digits as its factorization.
1012121011201 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 1012121011201 its reverse (1021101212101), we get a palindrome (2033222223302).
The spelling of 1012121011201 in words is "one trillion, twelve billion, one hundred twenty-one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •