Base | Representation |
---|---|
bin | 111000110111100001… |
… | …1010011001001100011 |
3 | 102200012220111120020001 |
4 | 1301233003103021203 |
5 | 4000101242021011 |
6 | 132034023000431 |
7 | 11552205513052 |
oct | 1615703231143 |
9 | 380186446201 |
10 | 122122220131 |
11 | 4787889a55a |
12 | 1b802599117 |
13 | b692a85022 |
14 | 5ca7138399 |
15 | 329b45b7c1 |
hex | 1c6f0d3263 |
122122220131 has 16 divisors (see below), whose sum is σ = 126756864000. Its totient is φ = 117516234528.
The previous prime is 122122220117. The next prime is 122122220173. The reversal of 122122220131 is 131022221221.
It is a cyclic number.
It is not a de Polignac number, because 122122220131 - 223 = 122113831523 is a prime.
It is a super-2 number, since 2×1221222201312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122122220099 and 122122220108.
It is not an unprimeable number, because it can be changed into a prime (122122220191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25530166 + ... + 25534948.
It is an arithmetic number, because the mean of its divisors is an integer number (7922304000).
Almost surely, 2122122220131 is an apocalyptic number.
122122220131 is a deficient number, since it is larger than the sum of its proper divisors (4634643869).
122122220131 is a wasteful number, since it uses less digits than its factorization.
122122220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7578.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 122122220131 its reverse (131022221221), we get a palindrome (253144441352).
The spelling of 122122220131 in words is "one hundred twenty-two billion, one hundred twenty-two million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •