Base | Representation |
---|---|
bin | 1111110011111… |
… | …11000100101000 |
3 | 100020120212100000 |
4 | 13321333010220 |
5 | 232424003224 |
6 | 21054543000 |
7 | 3200300433 |
oct | 771770450 |
9 | 306525300 |
10 | 132641064 |
11 | 68966216 |
12 | 38507a60 |
13 | 2163194a |
14 | 1388a81a |
15 | b9a10c9 |
hex | 7e7f128 |
132641064 has 144 divisors (see below), whose sum is σ = 390368160. Its totient is φ = 42184800.
The previous prime is 132641057. The next prime is 132641081. The reversal of 132641064 is 460146231.
132641064 is a `hidden beast` number, since 13 + 2 + 641 + 0 + 6 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1868149 + ... + 1868219.
It is an arithmetic number, because the mean of its divisors is an integer number (2710890).
Almost surely, 2132641064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132641064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195184080).
132641064 is an abundant number, since it is smaller than the sum of its proper divisors (257727096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132641064 is an equidigital number, since it uses as much as digits as its factorization.
132641064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 132641064 is about 11516.9902318271. The cubic root of 132641064 is about 509.9872661180.
Adding to 132641064 its reverse (460146231), we get a palindrome (592787295).
The spelling of 132641064 in words is "one hundred thirty-two million, six hundred forty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •