Base | Representation |
---|---|
bin | 110100110111001010… |
… | …0011101000110100000 |
3 | 101212000101220210012111 |
4 | 1221232110131012200 |
5 | 3324442110134121 |
6 | 124052251405104 |
7 | 11126063061160 |
oct | 1515624350640 |
9 | 355011823174 |
10 | 113520005536 |
11 | 441640a13a3 |
12 | 1a001753794 |
13 | a92184c312 |
14 | 56cc8ac5a0 |
15 | 2e461572e1 |
hex | 1a6e51d1a0 |
113520005536 has 24 divisors (see below), whose sum is σ = 255420012960. Its totient is φ = 48651430848.
The previous prime is 113520005513. The next prime is 113520005563. The reversal of 113520005536 is 635500025311.
It is a junction number, because it is equal to n+sod(n) for n = 113520005498 and 113520005507.
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 3 ways as a sum of consecutive naturals, for example, 253392646 + ... + 253393093.
It is an arithmetic number, because the mean of its divisors is an integer number (10642500540).
Almost surely, 2113520005536 is an apocalyptic number.
113520005536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
113520005536 is an abundant number, since it is smaller than the sum of its proper divisors (141900007424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113520005536 is an equidigital number, since it uses as much as digits as its factorization.
113520005536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506785756 (or 506785748 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 113520005536 in words is "one hundred thirteen billion, five hundred twenty million, five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •