Base | Representation |
---|---|
bin | 1100111011111000010… |
… | …1011100011000110011 |
3 | 210020121202112011011121 |
4 | 3032332011130120303 |
5 | 12120113000231011 |
6 | 250031524123111 |
7 | 22025061326365 |
oct | 3167605343063 |
9 | 706552464147 |
10 | 222232430131 |
11 | 8628045aaa8 |
12 | 370a1236497 |
13 | 17c5837158a |
14 | aa82a86d35 |
15 | 5baa1b5e71 |
hex | 33be15c633 |
222232430131 has 4 divisors (see below), whose sum is σ = 222234978672. Its totient is φ = 222229881592.
The previous prime is 222232430099. The next prime is 222232430141. The reversal of 222232430131 is 131034232222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 222232430131 - 25 = 222232430099 is a prime.
It is a super-2 number, since 2×2222324301312 (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 = 222232430096 and 222232430105.
It is not an unprimeable number, because it can be changed into a prime (222232430141) 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, 1138660 + ... + 1319473.
It is an arithmetic number, because the mean of its divisors is an integer number (55558744668).
Almost surely, 2222232430131 is an apocalyptic number.
222232430131 is a deficient number, since it is larger than the sum of its proper divisors (2548541).
222232430131 is an equidigital number, since it uses as much as digits as its factorization.
222232430131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2548540.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 222232430131 its reverse (131034232222), we get a palindrome (353266662353).
The spelling of 222232430131 in words is "two hundred twenty-two billion, two hundred thirty-two million, four hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •