Base | Representation |
---|---|
bin | 101110100100100101… |
… | …1111011100010001101 |
3 | 100120011000102200210210 |
4 | 1131021023323202031 |
5 | 3114311100041023 |
6 | 113540034353033 |
7 | 10140251632332 |
oct | 1351113734215 |
9 | 316130380723 |
10 | 100012112013 |
11 | 39462259030 |
12 | 17471a2b779 |
13 | 957b190708 |
14 | 4baa8d4989 |
15 | 290532d593 |
hex | 17492fb88d |
100012112013 has 8 divisors (see below), whose sum is σ = 145472162976. Its totient is φ = 60613401200.
The previous prime is 100012112009. The next prime is 100012112017. The reversal of 100012112013 is 310211210001.
It is an interprime number because it is at equal distance from previous prime (100012112009) and next prime (100012112017).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100012112013 - 22 = 100012112009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100012112013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012112017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1515334998 + ... + 1515335063.
It is an arithmetic number, because the mean of its divisors is an integer number (18184020372).
Almost surely, 2100012112013 is an apocalyptic number.
It is an amenable number.
100012112013 is a deficient number, since it is larger than the sum of its proper divisors (45460050963).
100012112013 is a wasteful number, since it uses less digits than its factorization.
100012112013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3030670075.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 100012112013 its reverse (310211210001), we get a palindrome (410223322014).
The spelling of 100012112013 in words is "one hundred billion, twelve million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •