Base | Representation |
---|---|
bin | 11101001111111110101… |
… | …001011011011001010100 |
3 | 21010011012220000012201010 |
4 | 131033332221123121110 |
5 | 230413011113001322 |
6 | 4135220311132220 |
7 | 265135135046412 |
oct | 35177651333124 |
9 | 7104186005633 |
10 | 2010022000212 |
11 | 70549a021996 |
12 | 285680374070 |
13 | 11770c985505 |
14 | 6d3dd8dc2b2 |
15 | 37442c8420c |
hex | 1d3fea5b654 |
2010022000212 has 12 divisors (see below), whose sum is σ = 4690051333856. Its totient is φ = 670007333400.
The previous prime is 2010022000201. The next prime is 2010022000213. The reversal of 2010022000212 is 2120002200102.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 167501833351 = 2010022000212 / (2 + 0 + 1 + 0 + 0 + 2 + 2 + 0 + 0 + 0 + 2 + 1 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010022000213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83750916664 + ... + 83750916687.
Almost surely, 22010022000212 is an apocalyptic number.
It is an amenable number.
2010022000212 is an abundant number, since it is smaller than the sum of its proper divisors (2680029333644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010022000212 is a wasteful number, since it uses less digits than its factorization.
2010022000212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167501833358 (or 167501833356 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2010022000212 its reverse (2120002200102), we get a palindrome (4130024200314).
The spelling of 2010022000212 in words is "two trillion, ten billion, twenty-two million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •