Base | Representation |
---|---|
bin | 11011110001000111000100… |
… | …100000100100100110000000 |
3 | 121000101202111021002011022211 |
4 | 123301013010200210212000 |
5 | 112001322031103000000 |
6 | 1111422041423311504 |
7 | 34503013350441424 |
oct | 3361070440444600 |
9 | 530352437064284 |
10 | 122122102000000 |
11 | 35a037689538a3 |
12 | 118440b8a4b594 |
13 | 531b0ac4b668b |
14 | 2222a540b2b84 |
15 | e1ba21de87ba |
hex | 6f11c4824980 |
122122102000000 has 112 divisors (see below), whose sum is σ = 304108768686060. Its totient is φ = 48848840000000.
The previous prime is 122122101999941. The next prime is 122122102000001. The reversal of 122122102000000 is 201221221.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122122102000001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 28530526 + ... + 32530525.
Almost surely, 2122122102000000 is an apocalyptic number.
122122102000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122122102000000 is an abundant number, since it is smaller than the sum of its proper divisors (181986666686060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122122102000000 is an frugal number, since it uses more digits than its factorization.
122122102000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61061095 (or 61061058 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 122122102000000 its reverse (201221221), we get a palindrome (122122303221221).
The spelling of 122122102000000 in words is "one hundred twenty-two trillion, one hundred twenty-two billion, one hundred two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •