Base | Representation |
---|---|
bin | 1010000000011010000001… |
… | …0100101001011010011000 |
3 | 1102221210100100002011010010 |
4 | 2200012200110221122120 |
5 | 2420224300324341440 |
6 | 35222143451321520 |
7 | 2213606214404151 |
oct | 240064024513230 |
9 | 42853310064103 |
10 | 11002101012120 |
11 | 3561a68219469 |
12 | 12983454502a0 |
13 | 61a6557a77aa |
14 | 2a070c606928 |
15 | 1412cad71580 |
hex | a01a0529698 |
11002101012120 has 32 divisors (see below), whose sum is σ = 33006303036720. Its totient is φ = 2933893603200.
The previous prime is 11002101012113. The next prime is 11002101012121. The reversal of 11002101012120 is 2121010120011.
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 = 11002101012096 and 11002101012105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002101012121) 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, 45842087431 + ... + 45842087670.
Almost surely, 211002101012120 is an apocalyptic number.
11002101012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11002101012120 is an abundant number, since it is smaller than the sum of its proper divisors (22004202024600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002101012120 is a wasteful number, since it uses less digits than its factorization.
11002101012120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91684175115 (or 91684175111 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11002101012120 its reverse (2121010120011), we get a palindrome (13123111132131).
The spelling of 11002101012120 in words is "eleven trillion, two billion, one hundred one million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •