Base | Representation |
---|---|
bin | 10100100111001100… |
… | …000100100001000011 |
3 | 2010010102211221121010 |
4 | 110213030010201003 |
5 | 330311332442011 |
6 | 14100100132003 |
7 | 1412313356226 |
oct | 244714044103 |
9 | 63112757533 |
10 | 22132312131 |
11 | 9428127756 |
12 | 4358097003 |
13 | 2119399ca7 |
14 | 10dd5835bd |
15 | 8980671a6 |
hex | 527304843 |
22132312131 has 8 divisors (see below), whose sum is σ = 30229499664. Its totient is φ = 14394999680.
The previous prime is 22132312099. The next prime is 22132312157. The reversal of 22132312131 is 13121323122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22132312131 - 25 = 22132312099 is a prime.
It is a super-2 number, since 2×221323121312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22132312098 and 22132312107.
It is not an unprimeable number, because it can be changed into a prime (22132312171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89968626 + ... + 89968871.
It is an arithmetic number, because the mean of its divisors is an integer number (3778687458).
Almost surely, 222132312131 is an apocalyptic number.
22132312131 is a deficient number, since it is larger than the sum of its proper divisors (8097187533).
22132312131 is a wasteful number, since it uses less digits than its factorization.
22132312131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179937541.
The product of its digits is 432, while the sum is 21.
Adding to 22132312131 its reverse (13121323122), we get a palindrome (35253635253).
The spelling of 22132312131 in words is "twenty-two billion, one hundred thirty-two million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •