Base | Representation |
---|---|
bin | 1001000111111000100000… |
… | …0110101110100100000001 |
3 | 1022111221211212121022202221 |
4 | 2101332020012232210001 |
5 | 2303322023204213441 |
6 | 33200105330411041 |
7 | 2053501220013313 |
oct | 221761006564401 |
9 | 38457755538687 |
10 | 10031032101121 |
11 | 3218156126989 |
12 | 11600b8430a81 |
13 | 579bcb2b9c35 |
14 | 26970c67d7b3 |
15 | 125de448e8d1 |
hex | 91f881ae901 |
10031032101121 has 2 divisors, whose sum is σ = 10031032101122. Its totient is φ = 10031032101120.
The previous prime is 10031032101113. The next prime is 10031032101143. The reversal of 10031032101121 is 12110123013001.
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., 5863003620496 + 4168028480625 = 2421364^2 + 2041575^2 .
It is a cyclic number.
It is not a de Polignac number, because 10031032101121 - 23 = 10031032101113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10031032101095 and 10031032101104.
It is not a weakly prime, because it can be changed into another prime (10031042101121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5015516050560 + 5015516050561.
It is an arithmetic number, because the mean of its divisors is an integer number (5015516050561).
Almost surely, 210031032101121 is an apocalyptic number.
It is an amenable number.
10031032101121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10031032101121 is an equidigital number, since it uses as much as digits as its factorization.
10031032101121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10031032101121 its reverse (12110123013001), we get a palindrome (22141155114122).
The spelling of 10031032101121 in words is "ten trillion, thirty-one billion, thirty-two million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •