Base | Representation |
---|---|
bin | 110110010000010000… |
… | …1011010100101110100 |
3 | 102010201202122102021000 |
4 | 1230200201122211310 |
5 | 3402102443410242 |
6 | 125305052123300 |
7 | 11263135341231 |
oct | 1544041324564 |
9 | 363652572230 |
10 | 116509747572 |
11 | 45458795889 |
12 | 1a6b6a66530 |
13 | acaa08174a |
14 | 58d39a4788 |
15 | 306d871a4c |
hex | 1b2085a974 |
116509747572 has 48 divisors (see below), whose sum is σ = 307761612480. Its totient is φ = 38103814944.
The previous prime is 116509747561. The next prime is 116509747583. The reversal of 116509747572 is 275747905611.
116509747572 is a `hidden beast` number, since 1 + 1 + 65 + 0 + 9 + 7 + 4 + 7 + 572 = 666.
It is an interprime number because it is at equal distance from previous prime (116509747561) and next prime (116509747583).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10171578 + ... + 10183025.
It is an arithmetic number, because the mean of its divisors is an integer number (6411700260).
Almost surely, 2116509747572 is an apocalyptic number.
116509747572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
116509747572 is an abundant number, since it is smaller than the sum of its proper divisors (191251864908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116509747572 is a wasteful number, since it uses less digits than its factorization.
116509747572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20354669 (or 20354661 counting only the distinct ones).
The product of its (nonzero) digits is 3704400, while the sum is 54.
The spelling of 116509747572 in words is "one hundred sixteen billion, five hundred nine million, seven hundred forty-seven thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •