Base | Representation |
---|---|
bin | 11101010000001001010… |
… | …101000110010001110100 |
3 | 21010011200101020112022220 |
4 | 131100021111012101310 |
5 | 230413343003021322 |
6 | 4135250152322340 |
7 | 265142442305613 |
oct | 35201125062164 |
9 | 7104611215286 |
10 | 2010201220212 |
11 | 705581201599 |
12 | 2857103a33b0 |
13 | 11773ab45353 |
14 | 6d41963187a |
15 | 3745388655c |
hex | 1d409546474 |
2010201220212 has 24 divisors (see below), whose sum is σ = 4841774982912. Its totient is φ = 648452006400.
The previous prime is 2010201220201. The next prime is 2010201220213. The reversal of 2010201220212 is 2120221020102.
It is a junction number, because it is equal to n+sod(n) for n = 2010201220191 and 2010201220200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010201220213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2701882989 + ... + 2701883732.
It is an arithmetic number, because the mean of its divisors is an integer number (201740624288).
Almost surely, 22010201220212 is an apocalyptic number.
It is an amenable number.
2010201220212 is an abundant number, since it is smaller than the sum of its proper divisors (2831573762700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010201220212 is a wasteful number, since it uses less digits than its factorization.
2010201220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5403766759 (or 5403766757 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2010201220212 its reverse (2120221020102), we get a palindrome (4130422240314).
The spelling of 2010201220212 in words is "two trillion, ten billion, two hundred one million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •