Base | Representation |
---|---|
bin | 110000001101000000011001… |
… | …111100110101110011110000 |
3 | 1000210122000002222102122211201 |
4 | 300031000121330311303300 |
5 | 210241402020401010000 |
6 | 2030515244252020544 |
7 | 62440332103631314 |
oct | 6015003174656360 |
9 | 1023560088378751 |
10 | 212000021110000 |
11 | 616057820a6432 |
12 | 1b93b036161754 |
13 | 913a693160196 |
14 | 3a4cbda339b44 |
15 | 1979918c7e96a |
hex | c0d019f35cf0 |
212000021110000 has 100 divisors (see below), whose sum is σ = 518355166956264. Its totient is φ = 83960404000000.
The previous prime is 212000021109983. The next prime is 212000021110001. The reversal of 212000021110000 is 11120000212.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212000021110001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 103940506 + ... + 105960505.
Almost surely, 2212000021110000 is an apocalyptic number.
212000021110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212000021110000 is an abundant number, since it is smaller than the sum of its proper divisors (306355145846264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212000021110000 is a wasteful number, since it uses less digits than its factorization.
212000021110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209901140 (or 209901119 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 212000021110000 its reverse (11120000212), we get a palindrome (212011141110212).
The spelling of 212000021110000 in words is "two hundred twelve trillion, twenty-one million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •