Base | Representation |
---|---|
bin | 1001001101001000011010… |
… | …0110111110010101101011 |
3 | 1022211120120220212220010202 |
4 | 2103102012212332111223 |
5 | 2311311210014010011 |
6 | 33305340553502415 |
7 | 2063142542454326 |
oct | 223220646762553 |
9 | 38746526786122 |
10 | 10121201313131 |
11 | 3252417311507 |
12 | 1175681a11a0b |
13 | 58556b1a695c |
14 | 26dc23c277bd |
15 | 1284205e323b |
hex | 934869be56b |
10121201313131 has 2 divisors, whose sum is σ = 10121201313132. Its totient is φ = 10121201313130.
The previous prime is 10121201313127. The next prime is 10121201313173. The reversal of 10121201313131 is 13131310212101.
It is a weak prime.
It is an emirp because it is prime and its reverse (13131310212101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10121201313131 - 22 = 10121201313127 is a prime.
It is a super-2 number, since 2×101212013131312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10121201313121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060600656565 + 5060600656566.
It is an arithmetic number, because the mean of its divisors is an integer number (5060600656566).
Almost surely, 210121201313131 is an apocalyptic number.
10121201313131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121201313131 is an equidigital number, since it uses as much as digits as its factorization.
10121201313131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10121201313131 its reverse (13131310212101), we get a palindrome (23252511525232).
The spelling of 10121201313131 in words is "ten trillion, one hundred twenty-one billion, two hundred one million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •