Base | Representation |
---|---|
bin | 10010110100000000… |
… | …11111000000000001 |
3 | 222001212221201102211 |
4 | 21122000133000001 |
5 | 131141100323014 |
6 | 4350114142121 |
7 | 505200451144 |
oct | 113200370001 |
9 | 28055851384 |
10 | 10100011009 |
11 | 4313213840 |
12 | 1b5a581941 |
13 | c4c635c9a |
14 | 6bb55805b |
15 | 3e1a65cc4 |
hex | 25a01f001 |
10100011009 has 8 divisors (see below), whose sum is σ = 11127286080. Its totient is φ = 9090918000.
The previous prime is 10100011007. The next prime is 10100011021. The reversal of 10100011009 is 90011000101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10100011009 - 21 = 10100011007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10100011009.
It is not an unprimeable number, because it can be changed into a prime (10100011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4544349 + ... + 4546570.
It is an arithmetic number, because the mean of its divisors is an integer number (1390910760).
Almost surely, 210100011009 is an apocalyptic number.
It is an amenable number.
10100011009 is a deficient number, since it is larger than the sum of its proper divisors (1027275071).
10100011009 is a wasteful number, since it uses less digits than its factorization.
10100011009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9091031.
The product of its (nonzero) digits is 9, while the sum is 13.
The spelling of 10100011009 in words is "ten billion, one hundred million, eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •