Base | Representation |
---|---|
bin | 1111110001000… |
… | …00101100101001 |
3 | 100012212020002000 |
4 | 13320200230221 |
5 | 232324121010 |
6 | 21042401213 |
7 | 3164100435 |
oct | 770405451 |
9 | 305766060 |
10 | 132254505 |
11 | 68721849 |
12 | 38360209 |
13 | 21527a06 |
14 | 137c99c5 |
15 | b9267c0 |
hex | 7e20b29 |
132254505 has 32 divisors (see below), whose sum is σ = 235768320. Its totient is φ = 70341120.
The previous prime is 132254503. The next prime is 132254537. The reversal of 132254505 is 505452231.
It is a happy number.
132254505 is a `hidden beast` number, since 132 + 25 + 4 + 505 = 666.
It is not a de Polignac number, because 132254505 - 21 = 132254503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (132254501) 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 31 ways as a sum of consecutive naturals, for example, 57049 + ... + 59321.
It is an arithmetic number, because the mean of its divisors is an integer number (7367760).
Almost surely, 2132254505 is an apocalyptic number.
132254505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132254505 is a deficient number, since it is larger than the sum of its proper divisors (103513815).
132254505 is a wasteful number, since it uses less digits than its factorization.
132254505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2718 (or 2712 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 132254505 is about 11500.1958678972. The cubic root of 132254505 is about 509.4913613999.
The spelling of 132254505 in words is "one hundred thirty-two million, two hundred fifty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •