Base | Representation |
---|---|
bin | 1010000000011010000011… |
… | …0110111110101011000100 |
3 | 1102221210100222000101202201 |
4 | 2200012200312332223010 |
5 | 2420224310130341400 |
6 | 35222144412244244 |
7 | 2213606354040154 |
oct | 240064066765304 |
9 | 42853328011681 |
10 | 11002110012100 |
11 | 3561a72306269 |
12 | 1298348470684 |
13 | 61a65760911c |
14 | 2a070d8aa764 |
15 | 1412cba4d06a |
hex | a01a0dbeac4 |
11002110012100 has 72 divisors (see below), whose sum is σ = 23893573713408. Its totient is φ = 4397344195200.
The previous prime is 11002110012071. The next prime is 11002110012193. The reversal of 11002110012100 is 121001120011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 791113347 + ... + 791127253.
It is an arithmetic number, because the mean of its divisors is an integer number (331855190464).
Almost surely, 211002110012100 is an apocalyptic number.
11002110012100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11002110012100 is an abundant number, since it is smaller than the sum of its proper divisors (12891463701308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002110012100 is a wasteful number, since it uses less digits than its factorization.
11002110012100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19645 (or 19638 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11002110012100 its reverse (121001120011), we get a palindrome (11123111132111).
The spelling of 11002110012100 in words is "eleven trillion, two billion, one hundred ten million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •