Base | Representation |
---|---|
bin | 100100110010011011111… |
… | …0100110101001011110000 |
3 | 122220100201012211010200111 |
4 | 1021210313310311023300 |
5 | 1130314404423303400 |
6 | 14430425111031104 |
7 | 1031202124162306 |
oct | 111446764651360 |
9 | 18810635733614 |
10 | 5056113103600 |
11 | 167a316041849 |
12 | 697aaa06b494 |
13 | 2a8a35480950 |
14 | 136a07d28276 |
15 | 8b7c3ae13ba |
hex | 49937d352f0 |
5056113103600 has 120 divisors (see below), whose sum is σ = 13082985069392. Its totient is φ = 1866692044800.
The previous prime is 5056113103579. The next prime is 5056113103621. The reversal of 5056113103600 is 63013116505.
It is an interprime number because it is at equal distance from previous prime (5056113103579) and next prime (5056113103621).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 61490515 + ... + 61572685.
Almost surely, 25056113103600 is an apocalyptic number.
5056113103600 is a gapful number since it is divisible by the number (50) 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 5056113103600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6541492534696).
5056113103600 is an abundant number, since it is smaller than the sum of its proper divisors (8026871965792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5056113103600 is a wasteful number, since it uses less digits than its factorization.
5056113103600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94035 (or 94024 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 31.
The spelling of 5056113103600 in words is "five trillion, fifty-six billion, one hundred thirteen million, one hundred three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •