Base | Representation |
---|---|
bin | 11101010010110010000… |
… | …011110000000100011100 |
3 | 21010102222122220011202200 |
4 | 131102302003300010130 |
5 | 230440142144203200 |
6 | 4140435114251500 |
7 | 265302544603125 |
oct | 35226203600434 |
9 | 7112878804680 |
10 | 2013032022300 |
11 | 7067a4108052 |
12 | 286180426b90 |
13 | 117a9c468680 |
14 | 6d60759304c |
15 | 3756c157800 |
hex | 1d4b20f011c |
2013032022300 has 108 divisors (see below), whose sum is σ = 6795101465880. Its totient is φ = 495515571840.
The previous prime is 2013032022263. The next prime is 2013032022311. The reversal of 2013032022300 is 32202303102.
It is a happy number.
2013032022300 is a `hidden beast` number, since 20 + 1 + 3 + 0 + 320 + 22 + 300 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 86015310 + ... + 86038709.
Almost surely, 22013032022300 is an apocalyptic number.
2013032022300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2013032022300 is an abundant number, since it is smaller than the sum of its proper divisors (4782069443580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013032022300 is a wasteful number, since it uses less digits than its factorization.
2013032022300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172054052 (or 172054042 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 2013032022300 its reverse (32202303102), we get a palindrome (2045234325402).
The spelling of 2013032022300 in words is "two trillion, thirteen billion, thirty-two million, twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •