Base | Representation |
---|---|
bin | 1001001101001000111001… |
… | …1010101001100101100011 |
3 | 1022211120221001100201112010 |
4 | 2103102032122221211203 |
5 | 2311311442032101011 |
6 | 33305401553204003 |
7 | 2063146023025533 |
oct | 223221632514543 |
9 | 38746831321463 |
10 | 10121332300131 |
11 | 3252484247a28 |
12 | 11756b9860603 |
13 | 58558c379760 |
14 | 26dc373a34c3 |
15 | 12842bd691a6 |
hex | 9348e6a9963 |
10121332300131 has 32 divisors (see below), whose sum is σ = 15391188267840. Its totient is φ = 5860948414464.
The previous prime is 10121332300127. The next prime is 10121332300153. The reversal of 10121332300131 is 13100323312101.
It is a happy number.
It is not a de Polignac number, because 10121332300131 - 22 = 10121332300127 is a prime.
It is a super-2 number, since 2×101213323001312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121332300098 and 10121332300107.
It is not an unprimeable number, because it can be changed into a prime (10121332302131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1762215 + ... + 4831983.
It is an arithmetic number, because the mean of its divisors is an integer number (480974633370).
Almost surely, 210121332300131 is an apocalyptic number.
10121332300131 is a deficient number, since it is larger than the sum of its proper divisors (5269855967709).
10121332300131 is a wasteful number, since it uses less digits than its factorization.
10121332300131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3074775.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10121332300131 its reverse (13100323312101), we get a palindrome (23221655612232).
The spelling of 10121332300131 in words is "ten trillion, one hundred twenty-one billion, three hundred thirty-two million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •