Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0011000110000001001 |
3 | 202021021010010212001102 |
4 | 3011131130120300021 |
5 | 11433204401320014 |
6 | 241222352231145 |
7 | 21214036533056 |
oct | 3053534306011 |
9 | 667233125042 |
10 | 212021120009 |
11 | 81a10438626 |
12 | 3511153b4b5 |
13 | 16cbb969b3a |
14 | a39483a02d |
15 | 57ad9b78de |
hex | 315d718c09 |
212021120009 has 4 divisors (see below), whose sum is σ = 212027082960. Its totient is φ = 212015157060.
The previous prime is 212021119997. The next prime is 212021120021. The reversal of 212021120009 is 900021120212.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (212021119997) and next prime (212021120021).
It is a cyclic number.
It is not a de Polignac number, because 212021120009 - 28 = 212021119753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212021150009) 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, 2927819 + ... + 2999360.
It is an arithmetic number, because the mean of its divisors is an integer number (53006770740).
Almost surely, 2212021120009 is an apocalyptic number.
It is an amenable number.
212021120009 is a deficient number, since it is larger than the sum of its proper divisors (5962951).
212021120009 is an equidigital number, since it uses as much as digits as its factorization.
212021120009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5962950.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 212021120009 in words is "two hundred twelve billion, twenty-one million, one hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •