Base | Representation |
---|---|
bin | 10100100110000011… |
… | …001101011011100011 |
3 | 2010002002220120022201 |
4 | 110212003031123203 |
5 | 330241440242011 |
6 | 14054134514031 |
7 | 1411662126133 |
oct | 244603153343 |
9 | 63062816281 |
10 | 22113212131 |
11 | 941837162a |
12 | 4351805917 |
13 | 211544040a |
14 | 10dac10ac3 |
15 | 896542cc1 |
hex | 5260cd6e3 |
22113212131 has 8 divisors (see below), whose sum is σ = 22261068800. Its totient is φ = 21965723208.
The previous prime is 22113212129. The next prime is 22113212137. The reversal of 22113212131 is 13121231122.
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 22113212131 - 21 = 22113212129 is a prime.
It is a super-2 number, since 2×221132121312 (a number of 21 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 = 22113212099 and 22113212108.
It is not an unprimeable number, because it can be changed into a prime (22113212137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29260 + ... + 212326.
It is an arithmetic number, because the mean of its divisors is an integer number (2782633600).
Almost surely, 222113212131 is an apocalyptic number.
22113212131 is a deficient number, since it is larger than the sum of its proper divisors (147856669).
22113212131 is a wasteful number, since it uses less digits than its factorization.
22113212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183873.
The product of its digits is 144, while the sum is 19.
Adding to 22113212131 its reverse (13121231122), we get a palindrome (35234443253).
The spelling of 22113212131 in words is "twenty-two billion, one hundred thirteen million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •