Base | Representation |
---|---|
bin | 11011110001000111000101… |
… | …101100110111111011010010 |
3 | 121000101202112122201101002110 |
4 | 123301013011230313323102 |
5 | 112001322101213032010 |
6 | 1111422043420130150 |
7 | 34503014012446605 |
oct | 3361070554677322 |
9 | 530352478641073 |
10 | 122122122002130 |
11 | 35a03779175788 |
12 | 11844103696956 |
13 | 531b0b369aa63 |
14 | 2222a569dc33c |
15 | e1ba23a4a120 |
hex | 6f11c5b37ed2 |
122122122002130 has 32 divisors (see below), whose sum is σ = 293726123276544. Its totient is φ = 32495562481536.
The previous prime is 122122122002077. The next prime is 122122122002131. The reversal of 122122122002130 is 31200221221221.
It is a junction number, because it is equal to n+sod(n) for n = 122122122002097 and 122122122002106.
It is not an unprimeable number, because it can be changed into a prime (122122122002131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4396030819 + ... + 4396058598.
It is an arithmetic number, because the mean of its divisors is an integer number (9178941352392).
Almost surely, 2122122122002130 is an apocalyptic number.
122122122002130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122122122002130 is an abundant number, since it is smaller than the sum of its proper divisors (171604001274414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122122122002130 is a wasteful number, since it uses less digits than its factorization.
122122122002130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8792089890.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 122122122002130 its reverse (31200221221221), we get a palindrome (153322343223351).
The spelling of 122122122002130 in words is "one hundred twenty-two trillion, one hundred twenty-two billion, one hundred twenty-two million, two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •