Base | Representation |
---|---|
bin | 1110100101001000100000… |
… | …1010000111101110011011 |
3 | 2002202120002002020111201121 |
4 | 3221102020022013232123 |
5 | 4100123144142200011 |
6 | 54032330422230111 |
7 | 3243131442152206 |
oct | 351221012075633 |
9 | 62676062214647 |
10 | 16031102303131 |
11 | 5120830358123 |
12 | 196ab27885337 |
13 | 8c395a059486 |
14 | 3d5ca390493d |
15 | 1cc014692e71 |
hex | e9488287b9b |
16031102303131 has 16 divisors (see below), whose sum is σ = 16297732487520. Its totient is φ = 15766436125440.
The previous prime is 16031102303113. The next prime is 16031102303207. The reversal of 16031102303131 is 13130320113061.
It is a cyclic number.
It is not a de Polignac number, because 16031102303131 - 213 = 16031102294939 is a prime.
It is a super-2 number, since 2×160311023031312 (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 = 16031102303096 and 16031102303105.
It is not an unprimeable number, because it can be changed into a prime (16031102343131) 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, 68805925 + ... + 69038521.
It is an arithmetic number, because the mean of its divisors is an integer number (1018608280470).
Almost surely, 216031102303131 is an apocalyptic number.
16031102303131 is a deficient number, since it is larger than the sum of its proper divisors (266630184389).
16031102303131 is a wasteful number, since it uses less digits than its factorization.
16031102303131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236814.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 16031102303131 its reverse (13130320113061), we get a palindrome (29161422416192).
The spelling of 16031102303131 in words is "sixteen trillion, thirty-one billion, one hundred two million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •