Base | Representation |
---|---|
bin | 11101001001100001001… |
… | …100000111101010100100 |
3 | 21002111022110102200221220 |
4 | 131021201030013222210 |
5 | 230304304320431022 |
6 | 4132112114140340 |
7 | 264501215231400 |
oct | 35114114075244 |
9 | 7074273380856 |
10 | 2003085327012 |
11 | 70255a4a0720 |
12 | 2842652816b0 |
13 | 116b75822863 |
14 | 6cd42548100 |
15 | 37188cc885c |
hex | 1d261307aa4 |
2003085327012 has 576 divisors, whose sum is σ = 6273712569600. Its totient is φ = 491178885120.
The previous prime is 2003085327007. The next prime is 2003085327053. The reversal of 2003085327012 is 2107235803002.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1619308458 + ... + 1619309694.
It is an arithmetic number, because the mean of its divisors is an integer number (10891862100).
Almost surely, 22003085327012 is an apocalyptic number.
2003085327012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2003085327012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3136856284800).
2003085327012 is an abundant number, since it is smaller than the sum of its proper divisors (4270627242588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003085327012 is a wasteful number, since it uses less digits than its factorization.
2003085327012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1484 (or 1475 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 33.
The spelling of 2003085327012 in words is "two trillion, three billion, eighty-five million, three hundred twenty-seven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •