Base | Representation |
---|---|
bin | 1010000000011010011101… |
… | …1010100011101100110101 |
3 | 1102221210122121222110200110 |
4 | 2200012213122203230311 |
5 | 2420230021310031401 |
6 | 35222203341533233 |
7 | 2213612160660546 |
oct | 240064732435465 |
9 | 42853577873613 |
10 | 11002220002101 |
11 | 3562019400399 |
12 | 1298379274219 |
13 | 61a674339a73 |
14 | 2a072033c4cd |
15 | 1412d65279d6 |
hex | a01a76a3b35 |
11002220002101 has 8 divisors (see below), whose sum is σ = 14743343387200. Its totient is φ = 7297954975872.
The previous prime is 11002220002093. The next prime is 11002220002121. The reversal of 11002220002101 is 10120002220011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11002220002101 - 23 = 11002220002093 is a prime.
It is a super-3 number, since 3×110022200021013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002220002121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9214589020 + ... + 9214590213.
It is an arithmetic number, because the mean of its divisors is an integer number (1842917923400).
Almost surely, 211002220002101 is an apocalyptic number.
It is an amenable number.
11002220002101 is a deficient number, since it is larger than the sum of its proper divisors (3741123385099).
11002220002101 is a wasteful number, since it uses less digits than its factorization.
11002220002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18429179435.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11002220002101 its reverse (10120002220011), we get a palindrome (21122222222112).
The spelling of 11002220002101 in words is "eleven trillion, two billion, two hundred twenty million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •