Base | Representation |
---|---|
bin | 10000010101001000111… |
… | …100001100000110010000 |
3 | 10222021121202110221010211 |
4 | 100111020330030012100 |
5 | 121341241302431000 |
6 | 2215311455133504 |
7 | 144035262221026 |
oct | 20251074140620 |
9 | 3867552427124 |
10 | 1122210202000 |
11 | 3a2a21448538 |
12 | 1615a9b14294 |
13 | 81a93347034 |
14 | 3c45b124716 |
15 | 1e2d07a17ba |
hex | 10548f0c190 |
1122210202000 has 160 divisors (see below), whose sum is σ = 2756088241920. Its totient is φ = 441849830400.
The previous prime is 1122210201997. The next prime is 1122210202013. The reversal of 1122210202000 is 2020122211.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 251783772 + ... + 251788228.
It is an arithmetic number, because the mean of its divisors is an integer number (17225551512).
Almost surely, 21122210202000 is an apocalyptic number.
1122210202000 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 1122210202000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1378044120960).
1122210202000 is an abundant number, since it is smaller than the sum of its proper divisors (1633878039920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122210202000 is a wasteful number, since it uses less digits than its factorization.
1122210202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6426 (or 6410 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1122210202000 its reverse (2020122211), we get a palindrome (1124230324211).
The spelling of 1122210202000 in words is "one trillion, one hundred twenty-two billion, two hundred ten million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •