Base | Representation |
---|---|
bin | 11001010001100… |
… | …00101111100001 |
3 | 112202221022210100 |
4 | 30220300233201 |
5 | 413233341001 |
6 | 33012053013 |
7 | 5153033535 |
oct | 1450605741 |
9 | 482838710 |
10 | 212012001 |
11 | a9747833 |
12 | 5b004169 |
13 | 34c018b6 |
14 | 2022bbc5 |
15 | 1392d586 |
hex | ca30be1 |
212012001 has 6 divisors (see below), whose sum is σ = 306239570. Its totient is φ = 141341328.
The previous prime is 212011993. The next prime is 212012033. The reversal of 212012001 is 100210212.
It can be written as a sum of positive squares in only one way, i.e., 180875601 + 31136400 = 13449^2 + 5580^2 .
It is not a de Polignac number, because 212012001 - 23 = 212011993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 23556889 = 212012001 / (2 + 1 + 2 + 0 + 1 + 2 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212012071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11778436 + ... + 11778453.
Almost surely, 2212012001 is an apocalyptic number.
It is an amenable number.
212012001 is a deficient number, since it is larger than the sum of its proper divisors (94227569).
212012001 is a wasteful number, since it uses less digits than its factorization.
212012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23556895 (or 23556892 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 212012001 is about 14560.6318887609. The cubic root of 212012001 is about 596.2844469373.
Adding to 212012001 its reverse (100210212), we get a palindrome (312222213).
The spelling of 212012001 in words is "two hundred twelve million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •