Base | Representation |
---|---|
bin | 10101011101111010… |
… | …01110100100110100 |
3 | 1002202012201212112110 |
4 | 22232331032210310 |
5 | 142100424030120 |
6 | 5143345251020 |
7 | 555414521262 |
oct | 125675164464 |
9 | 32665655473 |
10 | 11525220660 |
11 | 4984760958 |
12 | 2297933a70 |
13 | 11189a01c5 |
14 | 7b494d432 |
15 | 476c3a2e0 |
hex | 2aef4e934 |
11525220660 has 24 divisors (see below), whose sum is σ = 32270618016. Its totient is φ = 3073392160.
The previous prime is 11525220649. The next prime is 11525220661. The reversal of 11525220660 is 6602252511.
It is a super-2 number, since 2×115252206602 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11525220661) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 96043446 + ... + 96043565.
It is an arithmetic number, because the mean of its divisors is an integer number (1344609084).
Almost surely, 211525220660 is an apocalyptic number.
11525220660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11525220660 is an abundant number, since it is smaller than the sum of its proper divisors (20745397356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11525220660 is a wasteful number, since it uses less digits than its factorization.
11525220660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192087023 (or 192087021 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The spelling of 11525220660 in words is "eleven billion, five hundred twenty-five million, two hundred twenty thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •