Base | Representation |
---|---|
bin | 11101001111111110001… |
… | …000010001110010111100 |
3 | 21010011012021122201011121 |
4 | 131033332020101302330 |
5 | 230413001401411030 |
6 | 4135215401000324 |
7 | 265135001144053 |
oct | 35177610216274 |
9 | 7104167581147 |
10 | 2010013310140 |
11 | 705495126a10 |
12 | 2856794830a4 |
13 | 11770ac31c64 |
14 | 6d3dc6b939a |
15 | 3744211947a |
hex | 1d3fe211cbc |
2010013310140 has 24 divisors (see below), whose sum is σ = 4604757765552. Its totient is φ = 730913930880.
The previous prime is 2010013310119. The next prime is 2010013310167. The reversal of 2010013310140 is 410133100102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4568211849 + ... + 4568212288.
It is an arithmetic number, because the mean of its divisors is an integer number (191864906898).
Almost surely, 22010013310140 is an apocalyptic number.
2010013310140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010013310140 is an abundant number, since it is smaller than the sum of its proper divisors (2594744455412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010013310140 is a wasteful number, since it uses less digits than its factorization.
2010013310140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9136424157 (or 9136424155 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2010013310140 its reverse (410133100102), we get a palindrome (2420146410242).
The spelling of 2010013310140 in words is "two trillion, ten billion, thirteen million, three hundred ten thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •