Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …100001010001101000000 |
3 | 21010011012001200022101022 |
4 | 131033331330022031000 |
5 | 230413000043231222 |
6 | 4135215204525012 |
7 | 265134632143136 |
oct | 35177574121500 |
9 | 7104161608338 |
10 | 2010010133312 |
11 | 705493357135 |
12 | 2856783b0768 |
13 | 11770a38bc8c |
14 | 6d3dc0cd756 |
15 | 37441bdd042 |
hex | 1d3fdf0a340 |
2010010133312 has 56 divisors (see below), whose sum is σ = 4056173304960. Its totient is φ = 987999874560.
The previous prime is 2010010133273. The next prime is 2010010133317. The reversal of 2010010133312 is 2133310100102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010010133317) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7198613 + ... + 7472619.
It is an arithmetic number, because the mean of its divisors is an integer number (72431666160).
Almost surely, 22010010133312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2010010133312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2028086652480).
2010010133312 is an abundant number, since it is smaller than the sum of its proper divisors (2046163171648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010010133312 is a wasteful number, since it uses less digits than its factorization.
2010010133312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275959 (or 275949 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2010010133312 its reverse (2133310100102), we get a palindrome (4143320233414).
The spelling of 2010010133312 in words is "two trillion, ten billion, ten million, one hundred thirty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •