Base | Representation |
---|---|
bin | 1111110100111… |
… | …01010011101000 |
3 | 100020211011012200 |
4 | 13322131103220 |
5 | 232441434104 |
6 | 21101340200 |
7 | 3201324456 |
oct | 772352350 |
9 | 306734180 |
10 | 132764904 |
11 | 68a40268 |
12 | 38567660 |
13 | 2167611c |
14 | 138bd9d6 |
15 | b9c7b39 |
hex | 7e9d4e8 |
132764904 has 48 divisors (see below), whose sum is σ = 363151620. Its totient is φ = 43814400.
The previous prime is 132764903. The next prime is 132764921. The reversal of 132764904 is 409467231.
132764904 is a `hidden beast` number, since 1 + 3 + 2 + 7 + 649 + 0 + 4 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 127916100 + 4848804 = 11310^2 + 2202^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (132764903) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1857 + ... + 16400.
Almost surely, 2132764904 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 132764904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181575810).
132764904 is an abundant number, since it is smaller than the sum of its proper divisors (230386716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132764904 is a wasteful number, since it uses less digits than its factorization.
132764904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18370 (or 18363 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The square root of 132764904 is about 11522.3653821600. The cubic root of 132764904 is about 510.1459328635.
The spelling of 132764904 in words is "one hundred thirty-two million, seven hundred sixty-four thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •