Base | Representation |
---|---|
bin | 1100000111111110001110… |
… | …0110110001000110110011 |
3 | 1202012102220102112110021110 |
4 | 3001333203212301012303 |
5 | 3221404044120011011 |
6 | 44204120155524403 |
7 | 2544066065165001 |
oct | 301774346610663 |
9 | 52172812473243 |
10 | 13331102110131 |
11 | 427a763666743 |
12 | 15b37a7159703 |
13 | 75916b2bb390 |
14 | 34132badda71 |
15 | 181b8c5c0ba6 |
hex | c1fe39b11b3 |
13331102110131 has 16 divisors (see below), whose sum is σ = 19232816180480. Its totient is φ = 8164874783520.
The previous prime is 13331102110099. The next prime is 13331102110153. The reversal of 13331102110131 is 13101120113331.
It is not a de Polignac number, because 13331102110131 - 25 = 13331102110099 is a prime.
It is a super-2 number, since 2×133311021101312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13331102110098 and 13331102110107.
It is not an unprimeable number, because it can be changed into a prime (13331102110331) 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, 809999191 + ... + 810015648.
It is an arithmetic number, because the mean of its divisors is an integer number (1202051011280).
Almost surely, 213331102110131 is an apocalyptic number.
13331102110131 is a deficient number, since it is larger than the sum of its proper divisors (5901714070349).
13331102110131 is a wasteful number, since it uses less digits than its factorization.
13331102110131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1620015066.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 13331102110131 its reverse (13101120113331), we get a palindrome (26432222223462).
The spelling of 13331102110131 in words is "thirteen trillion, three hundred thirty-one billion, one hundred two million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •