Base | Representation |
---|---|
bin | 11101000111110111011… |
… | …000111110101101011110 |
3 | 21002022201202102122220200 |
4 | 131013313120332231132 |
5 | 230242140420011220 |
6 | 4131220025324330 |
7 | 264406222661340 |
oct | 35076730765536 |
9 | 7068652378820 |
10 | 2001310313310 |
11 | 701829552650 |
12 | 283a4a9366a6 |
13 | 116951b706a9 |
14 | 6cc148d7290 |
15 | 370d3058890 |
hex | 1d1f763eb5e |
2001310313310 has 96 divisors (see below), whose sum is σ = 6487364362752. Its totient is φ = 415856687040.
The previous prime is 2001310313257. The next prime is 2001310313329. The reversal of 2001310313310 is 133130131002.
It is a happy number.
2001310313310 is a `hidden beast` number, since 20 + 0 + 1 + 310 + 3 + 1 + 331 + 0 = 666.
It is a super-2 number, since 2×20013103133102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 144387754 + ... + 144401613.
It is an arithmetic number, because the mean of its divisors is an integer number (67576712112).
Almost surely, 22001310313310 is an apocalyptic number.
2001310313310 is an abundant number, since it is smaller than the sum of its proper divisors (4486054049442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001310313310 is a wasteful number, since it uses less digits than its factorization.
2001310313310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288789398 (or 288789395 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 2001310313310 its reverse (133130131002), we get a palindrome (2134440444312).
The spelling of 2001310313310 in words is "two trillion, one billion, three hundred ten million, three hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •