Base | Representation |
---|---|
bin | 110000001101000000011000… |
… | …110000100011001111101101 |
3 | 1000210122000001120210121101210 |
4 | 300031000120300203033231 |
5 | 210241402000241023041 |
6 | 2030515242255225033 |
7 | 62440331441635254 |
oct | 6015003060431755 |
9 | 1023560046717353 |
10 | 212000001111021 |
11 | 61605771886952 |
12 | 1b93b02b518179 |
13 | 913a68bc7a376 |
14 | 3a4cbd781179b |
15 | 197991712e016 |
hex | c0d018c233ed |
212000001111021 has 8 divisors (see below), whose sum is σ = 282674367656640. Its totient is φ = 141329484319712.
The previous prime is 212000001111001. The next prime is 212000001111049. The reversal of 212000001111021 is 120111100000212.
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 212000001111021 - 227 = 211999866893293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212000001110988 and 212000001111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212000001111001) 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, 962310081 + ... + 962530358.
It is an arithmetic number, because the mean of its divisors is an integer number (35334295957080).
Almost surely, 2212000001111021 is an apocalyptic number.
It is an amenable number.
212000001111021 is a deficient number, since it is larger than the sum of its proper divisors (70674366545619).
212000001111021 is a wasteful number, since it uses less digits than its factorization.
212000001111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1924877155.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 212000001111021 its reverse (120111100000212), we get a palindrome (332111101111233).
The spelling of 212000001111021 in words is "two hundred twelve trillion, one million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •