Base | Representation |
---|---|
bin | 11101000111110001011… |
… | …010110001101111111100 |
3 | 21002022110202220101012020 |
4 | 131013301122301233330 |
5 | 230241434242334322 |
6 | 4131202050040140 |
7 | 264403565236161 |
oct | 35076132615774 |
9 | 7068422811166 |
10 | 2001210121212 |
11 | 701787a3a865 |
12 | 283a21279050 |
13 | 116937190623 |
14 | 6cc05496068 |
15 | 370c936705c |
hex | 1d1f16b1bfc |
2001210121212 has 12 divisors (see below), whose sum is σ = 4669490282856. Its totient is φ = 667070040400.
The previous prime is 2001210121201. The next prime is 2001210121219. The reversal of 2001210121212 is 2121210121002.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 2001210121191 and 2001210121200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001210121219) 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, 83383755039 + ... + 83383755062.
It is an arithmetic number, because the mean of its divisors is an integer number (389124190238).
Almost surely, 22001210121212 is an apocalyptic number.
It is an amenable number.
2001210121212 is an abundant number, since it is smaller than the sum of its proper divisors (2668280161644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001210121212 is a wasteful number, since it uses less digits than its factorization.
2001210121212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166767510108 (or 166767510106 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2001210121212 its reverse (2121210121002), we get a palindrome (4122420242214).
The spelling of 2001210121212 in words is "two trillion, one billion, two hundred ten million, one hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •