Base | Representation |
---|---|
bin | 1010000000010010010001… |
… | …0110000111011000001101 |
3 | 1102221120222101012201101012 |
4 | 2200010210112013120031 |
5 | 2420211020340202341 |
6 | 35221201230055005 |
7 | 2213503526650520 |
oct | 240044426073015 |
9 | 42846871181335 |
10 | 11000021022221 |
11 | 35610a0108250 |
12 | 1297a6494a465 |
13 | 61a3b38a483a |
14 | 2a0592288bb7 |
15 | 14120845d0eb |
hex | a012458760d |
11000021022221 has 16 divisors (see below), whose sum is σ = 13973072531328. Its totient is φ = 8409719572800.
The previous prime is 11000021022217. The next prime is 11000021022223. The reversal of 11000021022221 is 12222012000011.
It is not a de Polignac number, because 11000021022221 - 22 = 11000021022217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000021022196 and 11000021022205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000021022223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1347707390 + ... + 1347715551.
It is an arithmetic number, because the mean of its divisors is an integer number (873317033208).
Almost surely, 211000021022221 is an apocalyptic number.
11000021022221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11000021022221 is a deficient number, since it is larger than the sum of its proper divisors (2973051509107).
11000021022221 is a wasteful number, since it uses less digits than its factorization.
11000021022221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2695423012.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11000021022221 its reverse (12222012000011), we get a palindrome (23222033022232).
The spelling of 11000021022221 in words is "eleven trillion, twenty-one million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •