Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …0111101000100011000010 |
3 | 1102221121011221220200220101 |
4 | 2200010221013220203002 |
5 | 2420211201341041002 |
6 | 35221213210433014 |
7 | 2213505521466442 |
oct | 240045107504302 |
9 | 42847157820811 |
10 | 11000101112002 |
11 | 356113133a952 |
12 | 1297a8773276a |
13 | 61a3c7366a42 |
14 | 2a059cb76122 |
15 | 1412104cd587 |
hex | a01291e88c2 |
11000101112002 has 8 divisors (see below), whose sum is σ = 16592331286800. Its totient is φ = 5469324016404.
The previous prime is 11000101111999. The next prime is 11000101112051. The reversal of 11000101112002 is 20021110100011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11000101112002.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15363269352 + ... + 15363270067.
It is an arithmetic number, because the mean of its divisors is an integer number (2074041410850).
Almost surely, 211000101112002 is an apocalyptic number.
11000101112002 is a deficient number, since it is larger than the sum of its proper divisors (5592230174798).
11000101112002 is a wasteful number, since it uses less digits than its factorization.
11000101112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30726539600.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11000101112002 its reverse (20021110100011), we get a palindrome (31021211212013).
The spelling of 11000101112002 in words is "eleven trillion, one hundred one million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •