Base | Representation |
---|---|
bin | 110000001110101000101100… |
… | …100010000100111110001101 |
3 | 1000211000201011010020211120021 |
4 | 300032220230202010332031 |
5 | 210300220340003323041 |
6 | 2031042524123222141 |
7 | 62451405100606360 |
oct | 6016505442047615 |
9 | 1024021133224507 |
10 | 212112002011021 |
11 | 61649216428822 |
12 | 1b958888377951 |
13 | 91480cab78168 |
14 | 3a543c06460d7 |
15 | 197c7bec15cd1 |
hex | c0ea2c884f8d |
212112002011021 has 8 divisors (see below), whose sum is σ = 243562596759104. Its totient is φ = 180948627306720.
The previous prime is 212112002010989. The next prime is 212112002011031. The reversal of 212112002011021 is 120110200211212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212112002011021 - 25 = 212112002010989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212112002010986 and 212112002011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212112002011031) 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, 71805009360 + ... + 71805012313.
It is an arithmetic number, because the mean of its divisors is an integer number (30445324594888).
Almost surely, 2212112002011021 is an apocalyptic number.
It is an amenable number.
212112002011021 is a deficient number, since it is larger than the sum of its proper divisors (31450594748083).
212112002011021 is a wasteful number, since it uses less digits than its factorization.
212112002011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143610021891.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 212112002011021 its reverse (120110200211212), we get a palindrome (332222202222233).
The spelling of 212112002011021 in words is "two hundred twelve trillion, one hundred twelve billion, two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •