Base | Representation |
---|---|
bin | 10100011111100111… |
… | …11110000011100010 |
3 | 1001101210112001221111 |
4 | 22033303332003202 |
5 | 140013142400002 |
6 | 5015442013534 |
7 | 536441256400 |
oct | 121763760342 |
9 | 31353461844 |
10 | 11002700002 |
11 | 47368123a8 |
12 | 21709472aa |
13 | 1064661598 |
14 | 7653b4470 |
15 | 445e243d7 |
hex | 28fcfe0e2 |
11002700002 has 12 divisors (see below), whose sum is σ = 19198588950. Its totient is φ = 4715442816.
The previous prime is 11002699979. The next prime is 11002700011. The reversal of 11002700002 is 20000720011.
It can be written as a sum of positive squares in only one way, i.e., 10699626721 + 303073281 = 103439^2 + 17409^2 .
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 56136127 + ... + 56136322.
Almost surely, 211002700002 is an apocalyptic number.
11002700002 is a deficient number, since it is larger than the sum of its proper divisors (8195888948).
11002700002 is a wasteful number, since it uses less digits than its factorization.
11002700002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112272465 (or 112272458 counting only the distinct ones).
The product of its (nonzero) digits is 28, while the sum is 13.
The spelling of 11002700002 in words is "eleven billion, two million, seven hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •