Base | Representation |
---|---|
bin | 11001010010001… |
… | …00111100000001 |
3 | 112210002112021001 |
4 | 30221010330001 |
5 | 413244012341 |
6 | 33013532001 |
7 | 5153526646 |
oct | 1451047401 |
9 | 483075231 |
10 | 212094721 |
11 | a97a39a3 |
12 | 5b044001 |
13 | 34c30447 |
14 | 2024ddcd |
15 | 13947d31 |
hex | ca44f01 |
212094721 has 8 divisors (see below), whose sum is σ = 213208200. Its totient is φ = 210984960.
The previous prime is 212094683. The next prime is 212094761. The reversal of 212094721 is 127490212.
It can be written as a sum of positive squares in 4 ways, for example, as 166126321 + 45968400 = 12889^2 + 6780^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212094721 - 27 = 212094593 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 212094721.
It is not an unprimeable number, because it can be changed into a prime (212094761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 261765 + ... + 262573.
It is an arithmetic number, because the mean of its divisors is an integer number (26651025).
Almost surely, 2212094721 is an apocalyptic number.
It is an amenable number.
212094721 is a deficient number, since it is larger than the sum of its proper divisors (1113479).
212094721 is an equidigital number, since it uses as much as digits as its factorization.
212094721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1859.
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 212094721 is about 14563.4721478087. The cubic root of 212094721 is about 596.3619869439.
The spelling of 212094721 in words is "two hundred twelve million, ninety-four thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •