Base | Representation |
---|---|
bin | 10100100000000001… |
… | …001100110011111101 |
3 | 2002211001111120120120 |
4 | 110200001030303331 |
5 | 330040034201023 |
6 | 14040122005153 |
7 | 1406323046202 |
oct | 244001146375 |
9 | 62731446516 |
10 | 22012022013 |
11 | 9376237a33 |
12 | 43239467b9 |
13 | 20ca4a0cc7 |
14 | 10cb5cdca9 |
15 | 88c7058e3 |
hex | 52004ccfd |
22012022013 has 8 divisors (see below), whose sum is σ = 29381582976. Its totient is φ = 14658571200.
The previous prime is 22012022003. The next prime is 22012022017. The reversal of 22012022013 is 31022021022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22012022013 - 212 = 22012017917 is a prime.
It is a super-2 number, since 2×220120220132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22012021983 and 22012022001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22012022017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4024348 + ... + 4029813.
It is an arithmetic number, because the mean of its divisors is an integer number (3672697872).
Almost surely, 222012022013 is an apocalyptic number.
It is an amenable number.
22012022013 is a deficient number, since it is larger than the sum of its proper divisors (7369560963).
22012022013 is an equidigital number, since it uses as much as digits as its factorization.
22012022013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8055075.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 22012022013 its reverse (31022021022), we get a palindrome (53034043035).
Subtracting 22012022013 from its reverse (31022021022), we obtain a palindrome (9009999009).
The spelling of 22012022013 in words is "twenty-two billion, twelve million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •