Base | Representation |
---|---|
bin | 1100000111111101111000… |
… | …1100011001100110011111 |
3 | 1202012102200002200102200212 |
4 | 3001333132030121212133 |
5 | 3221403402343441111 |
6 | 44204103153443035 |
7 | 2544063613336340 |
oct | 301773614314637 |
9 | 52172602612625 |
10 | 13331011312031 |
11 | 427a71738a796 |
12 | 15b378087047b |
13 | 75915554a0aa |
14 | 34131da260c7 |
15 | 181b8463798b |
hex | c1fde31999f |
13331011312031 has 16 divisors (see below), whose sum is σ = 15255308275200. Its totient is φ = 11411687499360.
The previous prime is 13331011312009. The next prime is 13331011312033. The reversal of 13331011312031 is 13021311013331.
It is a cyclic number.
It is not a de Polignac number, because 13331011312031 - 26 = 13331011311967 is a prime.
It is a super-2 number, since 2×133310113120312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13331011311988 and 13331011312006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331011312033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24725870 + ... + 25259268.
It is an arithmetic number, because the mean of its divisors is an integer number (953456767200).
Almost surely, 213331011312031 is an apocalyptic number.
13331011312031 is a deficient number, since it is larger than the sum of its proper divisors (1924296963169).
13331011312031 is an equidigital number, since it uses as much as digits as its factorization.
13331011312031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 538054.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13331011312031 its reverse (13021311013331), we get a palindrome (26352322325362).
The spelling of 13331011312031 in words is "thirteen trillion, three hundred thirty-one billion, eleven million, three hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •