Base | Representation |
---|---|
bin | 10110000100010101… |
… | …01111100011110100 |
3 | 1010120200012220211211 |
4 | 23002022233203310 |
5 | 143230431440430 |
6 | 5235341411204 |
7 | 566410230643 |
oct | 130212574364 |
9 | 33520186754 |
10 | 11847530740 |
11 | 502a693221 |
12 | 2367869b04 |
13 | 116a6aca26 |
14 | 80568d35a |
15 | 4951a472a |
hex | 2c22af8f4 |
11847530740 has 24 divisors (see below), whose sum is σ = 24882342912. Its totient is φ = 4738530720.
The previous prime is 11847530719. The next prime is 11847530789. The reversal of 11847530740 is 4703574811.
It is a happy number.
11847530740 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11847530693 and 11847530702.
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 7 ways as a sum of consecutive naturals, for example, 223917 + ... + 271723.
It is an arithmetic number, because the mean of its divisors is an integer number (1036764288).
Almost surely, 211847530740 is an apocalyptic number.
11847530740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11847530740 is an abundant number, since it is smaller than the sum of its proper divisors (13034812172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11847530740 is a wasteful number, since it uses less digits than its factorization.
11847530740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60207 (or 60205 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 40.
The spelling of 11847530740 in words is "eleven billion, eight hundred forty-seven million, five hundred thirty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •