Base | Representation |
---|---|
bin | 1001001101001000111001… |
… | …0010010101100110101011 |
3 | 1022211120220220021000111102 |
4 | 2103102032102111212223 |
5 | 2311311441002334011 |
6 | 33305401434352015 |
7 | 2063145665352005 |
oct | 223221622254653 |
9 | 38746826230442 |
10 | 10121330121131 |
11 | 3252482a998a9 |
12 | 11756b8b8b60b |
13 | 58558ba959c8 |
14 | 26dc36d97375 |
15 | 12842ba8873b |
hex | 9348e4959ab |
10121330121131 has 2 divisors, whose sum is σ = 10121330121132. Its totient is φ = 10121330121130.
The previous prime is 10121330121113. The next prime is 10121330121143. The reversal of 10121330121131 is 13112103312101.
Together with previous prime (10121330121113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10121330121131 - 234 = 10104150251947 is a prime.
It is a super-2 number, since 2×101213301211312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10121330121101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060665060565 + 5060665060566.
It is an arithmetic number, because the mean of its divisors is an integer number (5060665060566).
Almost surely, 210121330121131 is an apocalyptic number.
10121330121131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121330121131 is an equidigital number, since it uses as much as digits as its factorization.
10121330121131 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 10121330121131 its reverse (13112103312101), we get a palindrome (23233433433232).
The spelling of 10121330121131 in words is "ten trillion, one hundred twenty-one billion, three hundred thirty million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •