Base | Representation |
---|---|
bin | 1111110100000… |
… | …01110100010001 |
3 | 100020121102202100 |
4 | 13322001310101 |
5 | 232424333210 |
6 | 21055111013 |
7 | 3200345262 |
oct | 772016421 |
9 | 306542670 |
10 | 132652305 |
11 | 68973705 |
12 | 38512469 |
13 | 21636ab6 |
14 | 13890969 |
15 | b9a45c0 |
hex | 7e81d11 |
132652305 has 24 divisors (see below), whose sum is σ = 231619752. Its totient is φ = 70228224.
The previous prime is 132652277. The next prime is 132652307. The reversal of 132652305 is 503256231.
132652305 is a `hidden beast` number, since 1 + 3 + 2 + 652 + 3 + 0 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 10969344 + 121682961 = 3312^2 + 11031^2 .
It is not a de Polignac number, because 132652305 - 28 = 132652049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (132652307) 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 23 ways as a sum of consecutive naturals, for example, 4594 + ... + 16923.
It is an arithmetic number, because the mean of its divisors is an integer number (9650823).
Almost surely, 2132652305 is an apocalyptic number.
132652305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132652305 is a deficient number, since it is larger than the sum of its proper divisors (98967447).
132652305 is a wasteful number, since it uses less digits than its factorization.
132652305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21665 (or 21662 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 132652305 is about 11517.4782396148. The cubic root of 132652305 is about 510.0016724282.
The spelling of 132652305 in words is "one hundred thirty-two million, six hundred fifty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •