Base | Representation |
---|---|
bin | 10100101100011010… |
… | …100101001011100101 |
3 | 2010100112212001111211 |
4 | 110230122211023211 |
5 | 331001310031041 |
6 | 14112511431421 |
7 | 1414426621000 |
oct | 245432451345 |
9 | 63315761454 |
10 | 22220002021 |
11 | 9472680438 |
12 | 4381525571 |
13 | 21315c05b9 |
14 | 110b08c537 |
15 | 8a0ad9481 |
hex | 52c6a52e5 |
22220002021 has 16 divisors (see below), whose sum is σ = 25929702400. Its totient is φ = 19033101360.
The previous prime is 22220002009. The next prime is 22220002033. The reversal of 22220002021 is 12020002222.
It is an interprime number because it is at equal distance from previous prime (22220002009) and next prime (22220002033).
It is not a de Polignac number, because 22220002021 - 221 = 22217904869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22220001992 and 22220002010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22220002001) 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 15 ways as a sum of consecutive naturals, for example, 516811 + ... + 558151.
It is an arithmetic number, because the mean of its divisors is an integer number (1620606400).
Almost surely, 222220002021 is an apocalyptic number.
It is an amenable number.
22220002021 is a deficient number, since it is larger than the sum of its proper divisors (3709700379).
22220002021 is an equidigital number, since it uses as much as digits as its factorization.
22220002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42929 (or 42915 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 22220002021 its reverse (12020002222), we get a palindrome (34240004243).
The spelling of 22220002021 in words is "twenty-two billion, two hundred twenty million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •