Base | Representation |
---|---|
bin | 11101010010110110001… |
… | …000010010010100000000 |
3 | 21010110011102102001121010 |
4 | 131102312020102110000 |
5 | 230440312140220000 |
6 | 4140445554200520 |
7 | 265304334246600 |
oct | 35226610222400 |
9 | 7113142361533 |
10 | 2013100320000 |
11 | 706829716130 |
12 | 28619b283140 |
13 | 117ab065c403 |
14 | 6d612690c00 |
15 | 37573148d50 |
hex | 1d4b6212500 |
2013100320000 has 2160 divisors, whose sum is σ = 8805186238464. Its totient is φ = 403200000000.
The previous prime is 2013100319981. The next prime is 2013100320017. The reversal of 2013100320000 is 230013102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 8020319875 + ... + 8020320125.
Almost surely, 22013100320000 is an apocalyptic number.
2013100320000 is a gapful number since it is divisible by the number (20) 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 2013100320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4402593119232).
2013100320000 is an abundant number, since it is smaller than the sum of its proper divisors (6792085918464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013100320000 is a wasteful number, since it uses less digits than its factorization.
2013100320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346 (or 310 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 2013100320000 its reverse (230013102), we get a palindrome (2013330333102).
The spelling of 2013100320000 in words is "two trillion, thirteen billion, one hundred million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •