Base | Representation |
---|---|
bin | 10000010101001000111… |
… | …011011101010001011000 |
3 | 10222021121202010012001010 |
4 | 100111020323131101120 |
5 | 121341241230311300 |
6 | 2215311451053520 |
7 | 144035260461606 |
oct | 20251073352130 |
9 | 3867552105033 |
10 | 1122210010200 |
11 | 3a2a21327424 |
12 | 1615a9a412a0 |
13 | 81a932aa946 |
14 | 3c45b0b4876 |
15 | 1e2d0764a50 |
hex | 10548edd458 |
1122210010200 has 192 divisors, whose sum is σ = 3518440117920. Its totient is φ = 295859200000.
The previous prime is 1122210010157. The next prime is 1122210010223. The reversal of 1122210010200 is 20100122211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 42467392 + ... + 42493808.
Almost surely, 21122210010200 is an apocalyptic number.
1122210010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1122210010200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1759220058960).
1122210010200 is an abundant number, since it is smaller than the sum of its proper divisors (2396230107720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122210010200 is a wasteful number, since it uses less digits than its factorization.
1122210010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27238 (or 27229 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1122210010200 its reverse (20100122211), we get a palindrome (1142310132411).
The spelling of 1122210010200 in words is "one trillion, one hundred twenty-two billion, two hundred ten million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •