Base | Representation |
---|---|
bin | 1111110110000… |
… | …10010110100000 |
3 | 100021002212100112 |
4 | 13323002112200 |
5 | 233011313030 |
6 | 21104510452 |
7 | 3202526033 |
oct | 773022640 |
9 | 307085315 |
10 | 132916640 |
11 | 6903426a |
12 | 3861b428 |
13 | 216ca1cc |
14 | 1391d01a |
15 | ba07a95 |
hex | 7ec25a0 |
132916640 has 24 divisors (see below), whose sum is σ = 314015940. Its totient is φ = 53166592.
The previous prime is 132916613. The next prime is 132916643. The reversal of 132916640 is 46619231.
It can be written as a sum of positive squares in 2 ways, for example, as 122855056 + 10061584 = 11084^2 + 3172^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 132916597 and 132916606.
It is not an unprimeable number, because it can be changed into a prime (132916643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 415205 + ... + 415524.
Almost surely, 2132916640 is an apocalyptic number.
132916640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132916640 is an abundant number, since it is smaller than the sum of its proper divisors (181099300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132916640 is an equidigital number, since it uses as much as digits as its factorization.
132916640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830744 (or 830736 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 32.
The square root of 132916640 is about 11528.9479138385. The cubic root of 132916640 is about 510.3402061746.
The spelling of 132916640 in words is "one hundred thirty-two million, nine hundred sixteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •