Base | Representation |
---|---|
bin | 10101101110010110… |
… | …00001110011111101 |
3 | 1010002211002122020200 |
4 | 22313023001303331 |
5 | 142341220244000 |
6 | 5205151434113 |
7 | 562010225040 |
oct | 126713016375 |
9 | 33084078220 |
10 | 11663056125 |
11 | 4a45544766 |
12 | 2315b25939 |
13 | 113b400256 |
14 | 7c8d8cc57 |
15 | 483db5500 |
hex | 2b72c1cfd |
11663056125 has 96 divisors (see below), whose sum is σ = 25441827840. Its totient is φ = 5017996800.
The previous prime is 11663055991. The next prime is 11663056129. The reversal of 11663056125 is 52165036611.
11663056125 is a `hidden beast` number, since 1 + 1 + 6 + 6 + 30 + 5 + 612 + 5 = 666.
It is not a de Polignac number, because 11663056125 - 221 = 11660958973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11663056125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11663056129) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 90316 + ... + 177434.
It is an arithmetic number, because the mean of its divisors is an integer number (265019040).
Almost surely, 211663056125 is an apocalyptic number.
11663056125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11663056125 is an abundant number, since it is smaller than the sum of its proper divisors (13778771715).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11663056125 is a wasteful number, since it uses less digits than its factorization.
11663056125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87164 (or 87151 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 11663056125 in words is "eleven billion, six hundred sixty-three million, fifty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •