Base | Representation |
---|---|
bin | 10100011111011011… |
… | …110001010011101111 |
3 | 2002210101001002001211 |
4 | 110133123301103233 |
5 | 330030031210111 |
6 | 14035131415251 |
7 | 1406143461634 |
oct | 243733612357 |
9 | 62711032054 |
10 | 22002210031 |
11 | 937074605a |
12 | 43205b4527 |
13 | 20c8446bb9 |
14 | 10ca19818b |
15 | 88b918521 |
hex | 51f6f14ef |
22002210031 has 4 divisors (see below), whose sum is σ = 22077303192. Its totient is φ = 21927116872.
The previous prime is 22002210023. The next prime is 22002210073. The reversal of 22002210031 is 13001220022.
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 22002210031 - 23 = 22002210023 is a prime.
It is a super-2 number, since 2×220022100312 (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 = 22002209993 and 22002210020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22002210091) 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, 37546141 + ... + 37546726.
It is an arithmetic number, because the mean of its divisors is an integer number (5519325798).
Almost surely, 222002210031 is an apocalyptic number.
22002210031 is a deficient number, since it is larger than the sum of its proper divisors (75093161).
22002210031 is an equidigital number, since it uses as much as digits as its factorization.
22002210031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75093160.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 22002210031 its reverse (13001220022), we get a palindrome (35003430053).
Subtracting from 22002210031 its reverse (13001220022), we obtain a palindrome (9000990009).
The spelling of 22002210031 in words is "twenty-two billion, two million, two hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •