Base | Representation |
---|---|
bin | 11101010011000011111… |
… | …000101011110001011000 |
3 | 21010110202111200110022221 |
4 | 131103003320223301120 |
5 | 230441300231023000 |
6 | 4140524520553424 |
7 | 265313136035626 |
oct | 35230370536130 |
9 | 7113674613287 |
10 | 2013331111000 |
11 | 706937a198a0 |
12 | 286244622874 |
13 | 117b19407731 |
14 | 6d6351aa516 |
15 | 3758853661a |
hex | 1d4c3e2bc58 |
2013331111000 has 256 divisors, whose sum is σ = 5176514977920. Its totient is φ = 726865920000.
The previous prime is 2013331110977. The next prime is 2013331111007. The reversal of 2013331111000 is 1111333102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013331111007) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1052446044 + ... + 1052447956.
Almost surely, 22013331111000 is an apocalyptic number.
2013331111000 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 2013331111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2588257488960).
2013331111000 is an abundant number, since it is smaller than the sum of its proper divisors (3163183866920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013331111000 is a wasteful number, since it uses less digits than its factorization.
2013331111000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2583 (or 2569 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 2013331111000 its reverse (1111333102), we get a palindrome (2014442444102).
The spelling of 2013331111000 in words is "two trillion, thirteen billion, three hundred thirty-one million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •