Base | Representation |
---|---|
bin | 11101010001111011000… |
… | …111010010000110000101 |
3 | 21010100121102022210222020 |
4 | 131101323013102012011 |
5 | 230431300202414341 |
6 | 4140203424353353 |
7 | 265240652342121 |
oct | 35217307220605 |
9 | 7110542283866 |
10 | 2012110201221 |
11 | 70637083124a |
12 | 285b63775859 |
13 | 1179834a1a03 |
14 | 6d55ad96581 |
15 | 3751626a566 |
hex | 1d47b1d2185 |
2012110201221 has 16 divisors (see below), whose sum is σ = 2830912260480. Its totient is φ = 1268668079360.
The previous prime is 2012110201219. The next prime is 2012110201243. The reversal of 2012110201221 is 1221020112102.
It is a cyclic number.
It is not a de Polignac number, because 2012110201221 - 21 = 2012110201219 is a prime.
It is a super-2 number, since 2×20121102012212 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2012110201221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012110201921) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 163819800 + ... + 163832081.
It is an arithmetic number, because the mean of its divisors is an integer number (176932016280).
Almost surely, 22012110201221 is an apocalyptic number.
It is an amenable number.
2012110201221 is a deficient number, since it is larger than the sum of its proper divisors (818802059259).
2012110201221 is a wasteful number, since it uses less digits than its factorization.
2012110201221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327651996.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2012110201221 its reverse (1221020112102), we get a palindrome (3233130313323).
The spelling of 2012110201221 in words is "two trillion, twelve billion, one hundred ten million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •