Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …0101000110110111010000 |
3 | 1110101002020022220110011120 |
4 | 2201310200311012313100 |
5 | 2424143203101401000 |
6 | 35352320431242240 |
7 | 2225260305644304 |
oct | 241644065066720 |
9 | 43332208813146 |
10 | 11120221122000 |
11 | 35a8071a13291 |
12 | 12b720b679380 |
13 | 62882b37c733 |
14 | 2a6315ddbd04 |
15 | 1443e0c8c6a0 |
hex | a1d20d46dd0 |
11120221122000 has 80 divisors (see below), whose sum is σ = 35851592916672. Its totient is φ = 2965392297600.
The previous prime is 11120221121923. The next prime is 11120221122013. The reversal of 11120221122000 is 22112202111.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 926679094 + ... + 926691093.
Almost surely, 211120221122000 is an apocalyptic number.
11120221122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120221122000 is an abundant number, since it is smaller than the sum of its proper divisors (24731371794672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120221122000 is a wasteful number, since it uses less digits than its factorization.
11120221122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1853370213 (or 1853370197 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11120221122000 its reverse (22112202111), we get a palindrome (11142333324111).
The spelling of 11120221122000 in words is "eleven trillion, one hundred twenty billion, two hundred twenty-one million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •