Base | Representation |
---|---|
bin | 10101101110010110… |
… | …10111101100100000 |
3 | 1010002211021012012111 |
4 | 22313023113230200 |
5 | 142341231131020 |
6 | 5205153405104 |
7 | 562011050260 |
oct | 126713275440 |
9 | 33084235174 |
10 | 11663145760 |
11 | 4a455a6042 |
12 | 2315b69794 |
13 | 113b431ca6 |
14 | 7c8db37a0 |
15 | 483dd1d5a |
hex | 2b72d7b20 |
11663145760 has 192 divisors, whose sum is σ = 33029337600. Its totient is φ = 3807240192.
The previous prime is 11663145719. The next prime is 11663145761. The reversal of 11663145760 is 6754136611.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (11663145761) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2368581 + ... + 2373499.
It is an arithmetic number, because the mean of its divisors is an integer number (172027800).
Almost surely, 211663145760 is an apocalyptic number.
11663145760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11663145760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16514668800).
11663145760 is an abundant number, since it is smaller than the sum of its proper divisors (21366191840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11663145760 is a wasteful number, since it uses less digits than its factorization.
11663145760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5043 (or 5035 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 40.
The spelling of 11663145760 in words is "eleven billion, six hundred sixty-three million, one hundred forty-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •