Base | Representation |
---|---|
bin | 10010110101011100… |
… | …01110000000001101 |
3 | 222002201111211021000 |
4 | 21122232032000031 |
5 | 131202133000023 |
6 | 4351223130513 |
7 | 505404403413 |
oct | 113256160015 |
9 | 28081454230 |
10 | 10112000013 |
11 | 4319a62305 |
12 | 1b625a3a39 |
13 | c51c72c7b |
14 | 6bcd992b3 |
15 | 3e2b33243 |
hex | 25ab8e00d |
10112000013 has 32 divisors (see below), whose sum is σ = 16135961600. Its totient is φ = 6237988848.
The previous prime is 10111999999. The next prime is 10112000023. The reversal of 10112000013 is 31000021101.
10112000013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10112000013 - 25 = 10111999981 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10111999959 and 10112000004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112000023) 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, 207145 + ... + 251262.
It is an arithmetic number, because the mean of its divisors is an integer number (504248800).
Almost surely, 210112000013 is an apocalyptic number.
It is an amenable number.
10112000013 is a deficient number, since it is larger than the sum of its proper divisors (6023961587).
10112000013 is a wasteful number, since it uses less digits than its factorization.
10112000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458478 (or 458472 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10112000013 its reverse (31000021101), we get a palindrome (41112021114).
The spelling of 10112000013 in words is "ten billion, one hundred twelve million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •