Base | Representation |
---|---|
bin | 11011110010100010011011… |
… | …101011010101000101010000 |
3 | 121000202010200222000221220121 |
4 | 123302202123223111011100 |
5 | 112004423433001431000 |
6 | 1111535104005520024 |
7 | 34513055344054666 |
oct | 3362423353250520 |
9 | 530663628027817 |
10 | 122220201202000 |
11 | 35a41329339260 |
12 | 1185b116113014 |
13 | 5327414273275 |
14 | 22276bc8dcc36 |
15 | e1e364318b1a |
hex | 6f289bad5150 |
122220201202000 has 160 divisors (see below), whose sum is σ = 325586701260288. Its totient is φ = 44003672000000.
The previous prime is 122220201201991. The next prime is 122220201202027. The reversal of 122220201202000 is 202102022221.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25280296 + ... + 29724295.
Almost surely, 2122220201202000 is an apocalyptic number.
122220201202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122220201202000 is an abundant number, since it is smaller than the sum of its proper divisors (203366500058288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122220201202000 is a wasteful number, since it uses less digits than its factorization.
122220201202000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55004726 (or 55004710 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 122220201202000 its reverse (202102022221), we get a palindrome (122422303224221).
The spelling of 122220201202000 in words is "one hundred twenty-two trillion, two hundred twenty billion, two hundred one million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •