Base | Representation |
---|---|
bin | 1100010101110011100… |
… | …1101011100011110001 |
3 | 202021020111000121221011 |
4 | 3011130321223203301 |
5 | 11433200034201001 |
6 | 241221425230521 |
7 | 21213566311213 |
oct | 3053471534361 |
9 | 667214017834 |
10 | 212012022001 |
11 | 81a0629410a |
12 | 3510a492441 |
13 | 16cb9b029c0 |
14 | a39354c5b3 |
15 | 57accbbd51 |
hex | 315ce6b8f1 |
212012022001 has 8 divisors (see below), whose sum is σ = 228716350184. Its totient is φ = 195364224000.
The previous prime is 212012021993. The next prime is 212012022029. The reversal of 212012022001 is 100220210212.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 18680328976 + 193331693025 = 136676^2 + 439695^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 212012022001 - 23 = 212012021993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212012022041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14124750 + ... + 14139751.
It is an arithmetic number, because the mean of its divisors is an integer number (28589543773).
Almost surely, 2212012022001 is an apocalyptic number.
It is an amenable number.
212012022001 is a deficient number, since it is larger than the sum of its proper divisors (16704328183).
212012022001 is a wasteful number, since it uses less digits than its factorization.
212012022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28265091.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 212012022001 its reverse (100220210212), we get a palindrome (312232232213).
The spelling of 212012022001 in words is "two hundred twelve billion, twelve million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •