Base | Representation |
---|---|
bin | 1010000000110111100001… |
… | …1100110100110110110100 |
3 | 1102222112210100211010122101 |
4 | 2200031320130310312310 |
5 | 2420342011113031400 |
6 | 35225533445511444 |
7 | 2214306415613332 |
oct | 240157034646664 |
9 | 42875710733571 |
10 | 11010022002100 |
11 | 3565362431480 |
12 | 1299996112584 |
13 | 61b318846004 |
14 | 2a0c605c4b52 |
15 | 1415e146156a |
hex | a0378734db4 |
11010022002100 has 36 divisors (see below), whose sum is σ = 26063724814848. Its totient is φ = 4003644364000.
The previous prime is 11010022002079. The next prime is 11010022002143. The reversal of 11010022002100 is 120022001011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5004554356 + ... + 5004556555.
It is an arithmetic number, because the mean of its divisors is an integer number (723992355968).
Almost surely, 211010022002100 is an apocalyptic number.
11010022002100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010022002100 is an abundant number, since it is smaller than the sum of its proper divisors (15053702812748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010022002100 is a wasteful number, since it uses less digits than its factorization.
11010022002100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10009110936 (or 10009110929 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11010022002100 its reverse (120022001011), we get a palindrome (11130044003111).
The spelling of 11010022002100 in words is "eleven trillion, ten billion, twenty-two million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •