Base | Representation |
---|---|
bin | 10100100000100101… |
… | …011110100101110101 |
3 | 2002211201101201212002 |
4 | 110200211132211311 |
5 | 330100003011041 |
6 | 14041101505045 |
7 | 1406466635156 |
oct | 244045364565 |
9 | 62751351762 |
10 | 22021532021 |
11 | 9380642a45 |
12 | 4326b72185 |
13 | 20cc450828 |
14 | 10cc98792d |
15 | 88d48359b |
hex | 52095e975 |
22021532021 has 4 divisors (see below), whose sum is σ = 22033045452. Its totient is φ = 22010018592.
The previous prime is 22021532011. The next prime is 22021532023. The reversal of 22021532021 is 12023512022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13342560100 + 8678971921 = 115510^2 + 93161^2 .
It is a cyclic number.
It is not a de Polignac number, because 22021532021 - 26 = 22021531957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22021531984 and 22021532002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22021532023) 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 3 ways as a sum of consecutive naturals, for example, 5753846 + ... + 5757671.
It is an arithmetic number, because the mean of its divisors is an integer number (5508261363).
Almost surely, 222021532021 is an apocalyptic number.
It is an amenable number.
22021532021 is a deficient number, since it is larger than the sum of its proper divisors (11513431).
22021532021 is a wasteful number, since it uses less digits than its factorization.
22021532021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11513430.
The product of its (nonzero) digits is 480, while the sum is 20.
The spelling of 22021532021 in words is "twenty-two billion, twenty-one million, five hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •