Base | Representation |
---|---|
bin | 10010110101010111… |
… | …00011110111011011 |
3 | 222002200012102022120 |
4 | 21122223203313123 |
5 | 131201443200011 |
6 | 4351200152323 |
7 | 505365441606 |
oct | 113253436733 |
9 | 28080172276 |
10 | 10111303131 |
11 | 4319626776 |
12 | 1b623086a3 |
13 | c51a8aa07 |
14 | 6bcc5733d |
15 | 3e2a46a06 |
hex | 25aae3ddb |
10111303131 has 32 divisors (see below), whose sum is σ = 14625488640. Its totient is φ = 6191904384.
The previous prime is 10111303127. The next prime is 10111303151. The reversal of 10111303131 is 13130311101.
It is not a de Polignac number, because 10111303131 - 22 = 10111303127 is a prime.
It is a super-2 number, since 2×101113031312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10111303131.
It is not an unprimeable number, because it can be changed into a prime (10111303151) 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, 609756 + ... + 626118.
It is an arithmetic number, because the mean of its divisors is an integer number (457046520).
Almost surely, 210111303131 is an apocalyptic number.
10111303131 is a deficient number, since it is larger than the sum of its proper divisors (4514185509).
10111303131 is a wasteful number, since it uses less digits than its factorization.
10111303131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16715.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 10111303131 its reverse (13130311101), we get a palindrome (23241614232).
The spelling of 10111303131 in words is "ten billion, one hundred eleven million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •