Base | Representation |
---|---|
bin | 1010000000011010000101… |
… | …1101100000001110011000 |
3 | 1102221210101200000110212001 |
4 | 2200012201131200032120 |
5 | 2420224320222023000 |
6 | 35222145412530344 |
7 | 2213606535631054 |
oct | 240064135401630 |
9 | 42853350013761 |
10 | 11002120111000 |
11 | 3561a77a83767 |
12 | 129834b9209b4 |
13 | 61a6597339c5 |
14 | 2a0710d78c64 |
15 | 1412cc89546a |
hex | a01a1760398 |
11002120111000 has 32 divisors (see below), whose sum is σ = 25744961062080. Its totient is φ = 4400848044000.
The previous prime is 11002120110911. The next prime is 11002120111001. The reversal of 11002120111000 is 11102120011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002120111001) 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, 5501059056 + ... + 5501061055.
It is an arithmetic number, because the mean of its divisors is an integer number (804530033190).
Almost surely, 211002120111000 is an apocalyptic number.
11002120111000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11002120111000 is an abundant number, since it is smaller than the sum of its proper divisors (14742840951080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002120111000 is a wasteful number, since it uses less digits than its factorization.
11002120111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11002120132 (or 11002120118 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11002120111000 its reverse (11102120011), we get a palindrome (11013222231011).
The spelling of 11002120111000 in words is "eleven trillion, two billion, one hundred twenty million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •