Base | Representation |
---|---|
bin | 10100011111010100… |
… | …001011101101010100 |
3 | 2002210020022000122110 |
4 | 110133110023231110 |
5 | 330024024033022 |
6 | 14035021031020 |
7 | 1406120536020 |
oct | 243724135524 |
9 | 62706260573 |
10 | 22000221012 |
11 | 936a607740 |
12 | 431b9b5470 |
13 | 20c7bcb773 |
14 | 10c9bdb380 |
15 | 88b67400c |
hex | 51f50bb54 |
22000221012 has 48 divisors (see below), whose sum is σ = 64000645632. Its totient is φ = 5714342880.
The previous prime is 22000221007. The next prime is 22000221017. The reversal of 22000221012 is 21012200022.
It is an interprime number because it is at equal distance from previous prime (22000221007) and next prime (22000221017).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22000221017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11903958 + ... + 11905805.
It is an arithmetic number, because the mean of its divisors is an integer number (1333346784).
Almost surely, 222000221012 is an apocalyptic number.
22000221012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
22000221012 is an abundant number, since it is smaller than the sum of its proper divisors (42000424620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22000221012 is a wasteful number, since it uses less digits than its factorization.
22000221012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23809788 (or 23809786 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 22000221012 its reverse (21012200022), we get a palindrome (43012421034).
The spelling of 22000221012 in words is "twenty-two billion, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •