Base | Representation |
---|---|
bin | 111000111101101110… |
… | …0110000111000110011 |
3 | 102200202101220011022211 |
4 | 1301323130300320303 |
5 | 4001013014102011 |
6 | 132110413112551 |
7 | 11560312505635 |
oct | 1617334607063 |
9 | 380671804284 |
10 | 122330222131 |
11 | 47975248537 |
12 | 1b860188757 |
13 | b6c6bb1630 |
14 | 5cc6a00a55 |
15 | 32ae846b21 |
hex | 1c7b730e33 |
122330222131 has 4 divisors (see below), whose sum is σ = 131740239232. Its totient is φ = 112920205032.
The previous prime is 122330222087. The next prime is 122330222149. The reversal of 122330222131 is 131222033221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131222033221 = 71 ⋅1848197651.
It is a cyclic number.
It is not a de Polignac number, because 122330222131 - 213 = 122330213939 is a prime.
It is a super-2 number, since 2×1223302221312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122330222431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4705008531 + ... + 4705008556.
It is an arithmetic number, because the mean of its divisors is an integer number (32935059808).
Almost surely, 2122330222131 is an apocalyptic number.
122330222131 is a deficient number, since it is larger than the sum of its proper divisors (9410017101).
122330222131 is an equidigital number, since it uses as much as digits as its factorization.
122330222131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9410017100.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122330222131 its reverse (131222033221), we get a palindrome (253552255352).
The spelling of 122330222131 in words is "one hundred twenty-two billion, three hundred thirty million, two hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •