Base | Representation |
---|---|
bin | 11101000111111000100… |
… | …100001100101001100000 |
3 | 21002022210010112102202220 |
4 | 131013320210030221200 |
5 | 230242210441444300 |
6 | 4131222012111040 |
7 | 264406552404033 |
oct | 35077044145140 |
9 | 7068703472686 |
10 | 2001330031200 |
11 | 70183969aa25 |
12 | 283a55465480 |
13 | 116955c85596 |
14 | 6cc1738b01a |
15 | 370d4b50da0 |
hex | 1d1f890ca60 |
2001330031200 has 72 divisors (see below), whose sum is σ = 6514329259368. Its totient is φ = 533688007680.
The previous prime is 2001330031193. The next prime is 2001330031229. The reversal of 2001330031200 is 21300331002.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2001330031200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 416941357 + ... + 416946156.
It is an arithmetic number, because the mean of its divisors is an integer number (90476795269).
Almost surely, 22001330031200 is an apocalyptic number.
2001330031200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2001330031200 is an abundant number, since it is smaller than the sum of its proper divisors (4512999228168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001330031200 is a wasteful number, since it uses less digits than its factorization.
2001330031200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 833887536 (or 833887523 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 2001330031200 its reverse (21300331002), we get a palindrome (2022630362202).
The spelling of 2001330031200 in words is "two trillion, one billion, three hundred thirty million, thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •