Base | Representation |
---|---|
bin | 11101000111110111011… |
… | …000111111001001111000 |
3 | 21002022201202102202102000 |
4 | 131013313120333021320 |
5 | 230242140420041003 |
6 | 4131220025341000 |
7 | 264406222666545 |
oct | 35076730771170 |
9 | 7068652382360 |
10 | 2001310315128 |
11 | 701829553a53 |
12 | 283a4a937760 |
13 | 116951b71477 |
14 | 6cc148d7bcc |
15 | 370d30591a3 |
hex | 1d1f763f278 |
2001310315128 has 128 divisors (see below), whose sum is σ = 5887501588800. Its totient is φ = 627723952128.
The previous prime is 2001310315061. The next prime is 2001310315129. The reversal of 2001310315128 is 8215130131002.
2001310315128 is a `hidden beast` number, since 20 + 0 + 1 + 310 + 315 + 12 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001310315129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17322000 + ... + 17437152.
Almost surely, 22001310315128 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 2001310315128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2943750794400).
2001310315128 is an abundant number, since it is smaller than the sum of its proper divisors (3886191273672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001310315128 is a wasteful number, since it uses less digits than its factorization.
2001310315128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119918 (or 119908 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The spelling of 2001310315128 in words is "two trillion, one billion, three hundred ten million, three hundred fifteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •