Base | Representation |
---|---|
bin | 1010000000011010011101… |
… | …1010100011101110100010 |
3 | 1102221210122121222110211111 |
4 | 2200012213122203232202 |
5 | 2420230021310032320 |
6 | 35222203341533534 |
7 | 2213612160661063 |
oct | 240064732435642 |
9 | 42853577873744 |
10 | 11002220002210 |
11 | 3562019400488 |
12 | 12983792742aa |
13 | 61a674339b28 |
14 | 2a072033c56a |
15 | 1412d6527a5a |
hex | a01a76a3ba2 |
11002220002210 has 8 divisors (see below), whose sum is σ = 19803996003996. Its totient is φ = 4400888000880.
The previous prime is 11002220002201. The next prime is 11002220002219. The reversal of 11002220002210 is 1220002220011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11002220002201) and next prime (11002220002219).
It can be written as a sum of positive squares in 2 ways, for example, as 10100948883601 + 901271118609 = 3178199^2 + 949353^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (11002220002219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550111000101 + ... + 550111000120.
Almost surely, 211002220002210 is an apocalyptic number.
11002220002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11002220002210 is a deficient number, since it is larger than the sum of its proper divisors (8801776001786).
11002220002210 is a wasteful number, since it uses less digits than its factorization.
11002220002210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100222000228.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 11002220002210 its reverse (1220002220011), we get a palindrome (12222222222221).
The spelling of 11002220002210 in words is "eleven trillion, two billion, two hundred twenty million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •