Base | Representation |
---|---|
bin | 1010000000010010001111… |
… | …0100100010101100100100 |
3 | 1102221120221202122120200012 |
4 | 2200010203310202230210 |
5 | 2420211011112034340 |
6 | 35221200313305352 |
7 | 2213503362103601 |
oct | 240044364425444 |
9 | 42846852576605 |
10 | 11000012221220 |
11 | 35610961469a0 |
12 | 1297a61a05258 |
13 | 61a3b1b12949 |
14 | 2a05910376a8 |
15 | 1412077c0565 |
hex | a0123d22b24 |
11000012221220 has 24 divisors (see below), whose sum is σ = 25200027998208. Its totient is φ = 4000004444000.
The previous prime is 11000012221193. The next prime is 11000012221223. The reversal of 11000012221220 is 2212221000011.
It is a junction number, because it is equal to n+sod(n) for n = 11000012221195 and 11000012221204.
It is not an unprimeable number, because it can be changed into a prime (11000012221223) 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, 25000027556 + ... + 25000027995.
It is an arithmetic number, because the mean of its divisors is an integer number (1050001166592).
Almost surely, 211000012221220 is an apocalyptic number.
11000012221220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000012221220 is an abundant number, since it is smaller than the sum of its proper divisors (14200015776988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000012221220 is a wasteful number, since it uses less digits than its factorization.
11000012221220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50000055571 (or 50000055569 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11000012221220 its reverse (2212221000011), we get a palindrome (13212233221231).
The spelling of 11000012221220 in words is "eleven trillion, twelve million, two hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •