Base | Representation |
---|---|
bin | 1100010110100101011… |
… | …0110111110100111101 |
3 | 202021210001020212020212 |
4 | 3011221112313310331 |
5 | 11434112034013041 |
6 | 241254252322205 |
7 | 21222014513411 |
oct | 3055126676475 |
9 | 667701225225 |
10 | 212221001021 |
11 | 8200324a147 |
12 | 35168473365 |
13 | 170211b1c23 |
14 | a3b31cad41 |
15 | 57c12eb8eb |
hex | 31695b7d3d |
212221001021 has 8 divisors (see below), whose sum is σ = 215885876640. Its totient is φ = 208558389168.
The previous prime is 212221000969. The next prime is 212221001053. The reversal of 212221001021 is 120100122212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212221001021 - 210 = 212220999997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 212221000987 and 212221001005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212221501021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 376286 + ... + 752351.
It is an arithmetic number, because the mean of its divisors is an integer number (26985734580).
Almost surely, 2212221001021 is an apocalyptic number.
It is an amenable number.
212221001021 is a deficient number, since it is larger than the sum of its proper divisors (3664875619).
212221001021 is a wasteful number, since it uses less digits than its factorization.
212221001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1131883.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212221001021 its reverse (120100122212), we get a palindrome (332321123233).
The spelling of 212221001021 in words is "two hundred twelve billion, two hundred twenty-one million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •