Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …0011110001110110000100 |
3 | 1102221210002022020100211010 |
4 | 2200012122103301312010 |
5 | 2420224044012334340 |
6 | 35222125445042220 |
7 | 2213603551011453 |
oct | 240063223616604 |
9 | 42853068210733 |
10 | 11002000121220 |
11 | 3561a16279659 |
12 | 12983176b6370 |
13 | 61a63a911634 |
14 | 2a06dd062b9a |
15 | 1412c2092b80 |
hex | a019a4f1d84 |
11002000121220 has 48 divisors (see below), whose sum is σ = 30855528482688. Its totient is φ = 2929111637760.
The previous prime is 11002000121213. The next prime is 11002000121239. The reversal of 11002000121220 is 2212100020011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11002000121196 and 11002000121205.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 148558336 + ... + 148632375.
It is an arithmetic number, because the mean of its divisors is an integer number (642823510056).
Almost surely, 211002000121220 is an apocalyptic number.
11002000121220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11002000121220 is an abundant number, since it is smaller than the sum of its proper divisors (19853528361468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002000121220 is a wasteful number, since it uses less digits than its factorization.
11002000121220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 297191340 (or 297191338 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11002000121220 its reverse (2212100020011), we get a palindrome (13214100141231).
The spelling of 11002000121220 in words is "eleven trillion, two billion, one hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •