Base | Representation |
---|---|
bin | 10010110101100001… |
… | …00011011010101101 |
3 | 222002202122220202200 |
4 | 21122300203122231 |
5 | 131202312041023 |
6 | 4351244212113 |
7 | 505412532600 |
oct | 113260433255 |
9 | 28082586680 |
10 | 10112612013 |
11 | 431a340099 |
12 | 1b6283a039 |
13 | c521286ba |
14 | 6bd0b8337 |
15 | 3e2c04743 |
hex | 25ac236ad |
10112612013 has 72 divisors (see below), whose sum is σ = 17371411200. Its totient is φ = 5651021376.
The previous prime is 10112611987. The next prime is 10112612023. The reversal of 10112612013 is 31021621101.
10112612013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10112612013 - 28 = 10112611757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112612023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 3796120 + ... + 3798782.
It is an arithmetic number, because the mean of its divisors is an integer number (241269600).
Almost surely, 210112612013 is an apocalyptic number.
It is an amenable number.
10112612013 is a deficient number, since it is larger than the sum of its proper divisors (7258799187).
10112612013 is a wasteful number, since it uses less digits than its factorization.
10112612013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2871 (or 2861 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The spelling of 10112612013 in words is "ten billion, one hundred twelve million, six hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.318 sec. • engine limits •