Base | Representation |
---|---|
bin | 11101010010110010000… |
… | …000010011110010000000 |
3 | 21010102222121012100001011 |
4 | 131102302000103302000 |
5 | 230440141431320000 |
6 | 4140435043050304 |
7 | 265302534124405 |
oct | 35226200236200 |
9 | 7112877170034 |
10 | 2013031120000 |
11 | 7067a365114a |
12 | 286180070994 |
13 | 117a9c210a74 |
14 | 6d6073da2ac |
15 | 3756c02a2ba |
hex | 1d4b2013c80 |
2013031120000 has 240 divisors, whose sum is σ = 5136866653050. Its totient is φ = 785520640000.
The previous prime is 2013031119949. The next prime is 2013031120027. The reversal of 2013031120000 is 211303102.
It can be written as a sum of positive squares in 15 ways, for example, as 2008932047424 + 4099072576 = 1417368^2 + 64024^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 134472516 + ... + 134487484.
Almost surely, 22013031120000 is an apocalyptic number.
2013031120000 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 2013031120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2568433326525).
2013031120000 is an abundant number, since it is smaller than the sum of its proper divisors (3123835533050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013031120000 is an frugal number, since it uses more digits than its factorization.
2013031120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15085 (or 15017 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 2013031120000 its reverse (211303102), we get a palindrome (2013242423102).
The spelling of 2013031120000 in words is "two trillion, thirteen billion, thirty-one million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •