Base | Representation |
---|---|
bin | 11101010011000011010… |
… | …110010111000001001100 |
3 | 21010110201212202022112101 |
4 | 131103003112113001030 |
5 | 230441240430104400 |
6 | 4140524000044444 |
7 | 265312666411654 |
oct | 35230326270114 |
9 | 7113655668471 |
10 | 2013322113100 |
11 | 706932933611 |
12 | 286241603724 |
13 | 117b175a702c |
14 | 6d633d07364 |
15 | 3758785a56a |
hex | 1d4c359704c |
2013322113100 has 36 divisors (see below), whose sum is σ = 4380316141824. Its totient is φ = 803226143680.
The previous prime is 2013322113073. The next prime is 2013322113157. The reversal of 2013322113100 is 13112233102.
It is a super-2 number, since 2×20133221131002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26245279 + ... + 26321878.
It is an arithmetic number, because the mean of its divisors is an integer number (121675448384).
Almost surely, 22013322113100 is an apocalyptic number.
2013322113100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2013322113100 is an abundant number, since it is smaller than the sum of its proper divisors (2366994028724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013322113100 is a wasteful number, since it uses less digits than its factorization.
2013322113100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52567554 (or 52567547 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2013322113100 its reverse (13112233102), we get a palindrome (2026434346202).
The spelling of 2013322113100 in words is "two trillion, thirteen billion, three hundred twenty-two million, one hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •