Base | Representation |
---|---|
bin | 1010000111011001000101… |
… | …1010100111010000011000 |
3 | 1110101021002222011111200111 |
4 | 2201312101122213100120 |
5 | 2424211040130032300 |
6 | 35353232104414104 |
7 | 2225355153111541 |
oct | 241662132472030 |
9 | 43337088144614 |
10 | 11122110002200 |
11 | 35a89511639aa |
12 | 12b7658177334 |
13 | 628a6c7bbb22 |
14 | 2a6454c0d4c8 |
15 | 1444a1a009ba |
hex | a1d916a7418 |
11122110002200 has 24 divisors (see below), whose sum is σ = 25858905755580. Its totient is φ = 4448844000800.
The previous prime is 11122110002191. The next prime is 11122110002203. The reversal of 11122110002200 is 220001122111.
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122110002203) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 27805274806 + ... + 27805275205.
Almost surely, 211122110002200 is an apocalyptic number.
11122110002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11122110002200 is an abundant number, since it is smaller than the sum of its proper divisors (14736795753380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122110002200 is a wasteful number, since it uses less digits than its factorization.
11122110002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55610550027 (or 55610550018 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11122110002200 its reverse (220001122111), we get a palindrome (11342111124311).
The spelling of 11122110002200 in words is "eleven trillion, one hundred twenty-two billion, one hundred ten million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •