Base | Representation |
---|---|
bin | 110000001101000000011111… |
… | …011000000001010010111101 |
3 | 1000210122000100022200111111021 |
4 | 300031000133120001102331 |
5 | 210241402212200333041 |
6 | 2030515301302424141 |
7 | 62440334260334500 |
oct | 6015003730012275 |
9 | 1023560308614437 |
10 | 212000112121021 |
11 | 61605819508354 |
12 | 1b93b060732051 |
13 | 913a6a8c77363 |
14 | 3a4cc0846b137 |
15 | 1979921c5acd1 |
hex | c0d01f6014bd |
212000112121021 has 12 divisors (see below), whose sum is σ = 246635529849120. Its totient is φ = 181697320589400.
The previous prime is 212000112121019. The next prime is 212000112121051. The reversal of 212000112121021 is 120121211000212.
It is not a de Polignac number, because 212000112121021 - 21 = 212000112121019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212000112120986 and 212000112121004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212000112121051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 202582641 + ... + 203626438.
It is an arithmetic number, because the mean of its divisors is an integer number (20552960820760).
Almost surely, 2212000112121021 is an apocalyptic number.
It is an amenable number.
212000112121021 is a deficient number, since it is larger than the sum of its proper divisors (34635417728099).
212000112121021 is a wasteful number, since it uses less digits than its factorization.
212000112121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 406219744 (or 406219737 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 212000112121021 its reverse (120121211000212), we get a palindrome (332121323121233).
The spelling of 212000112121021 in words is "two hundred twelve trillion, one hundred twelve million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •