Base | Representation |
---|---|
bin | 10100011111100111… |
… | …11110000011100001 |
3 | 1001101210112001221110 |
4 | 22033303332003201 |
5 | 140013142400001 |
6 | 5015442013533 |
7 | 536441256366 |
oct | 121763760341 |
9 | 31353461843 |
10 | 11002700001 |
11 | 47368123a7 |
12 | 21709472a9 |
13 | 1064661597 |
14 | 7653b446d |
15 | 445e243d6 |
hex | 28fcfe0e1 |
11002700001 has 32 divisors (see below), whose sum is σ = 15032896000. Its totient is φ = 7156283904.
The previous prime is 11002699979. The next prime is 11002700011. The reversal of 11002700001 is 10000720011.
It is not a de Polignac number, because 11002700001 - 26 = 11002699937 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 11002700001.
It is not an unprimeable number, because it can be changed into a prime (11002700011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16348401 + ... + 16349073.
It is an arithmetic number, because the mean of its divisors is an integer number (469778000).
Almost surely, 211002700001 is an apocalyptic number.
It is an amenable number.
11002700001 is a deficient number, since it is larger than the sum of its proper divisors (4030195999).
11002700001 is a wasteful number, since it uses less digits than its factorization.
11002700001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1405.
The product of its (nonzero) digits is 14, while the sum is 12.
The spelling of 11002700001 in words is "eleven billion, two million, seven hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •