Base | Representation |
---|---|
bin | 1111101111001… |
… | …00101000000001 |
3 | 100012101201112211 |
4 | 13313210220001 |
5 | 232243232244 |
6 | 21033222121 |
7 | 3162024166 |
oct | 767445001 |
9 | 305351484 |
10 | 132008449 |
11 | 685739a1 |
12 | 38261941 |
13 | 2146ca11 |
14 | 1376406d |
15 | b8c8934 |
hex | 7de4a01 |
132008449 has 4 divisors (see below), whose sum is σ = 133491780. Its totient is φ = 130525120.
The previous prime is 132008423. The next prime is 132008467. The reversal of 132008449 is 944800231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 55130625 + 76877824 = 7425^2 + 8768^2 .
It is a cyclic number.
It is not a de Polignac number, because 132008449 - 29 = 132007937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132008449.
It is not an unprimeable number, because it can be changed into a prime (132002449) 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, 741532 + ... + 741709.
It is an arithmetic number, because the mean of its divisors is an integer number (33372945).
Almost surely, 2132008449 is an apocalyptic number.
It is an amenable number.
132008449 is a deficient number, since it is larger than the sum of its proper divisors (1483331).
132008449 is an equidigital number, since it uses as much as digits as its factorization.
132008449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1483330.
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 132008449 is about 11489.4929827212. The cubic root of 132008449 is about 509.1752001925.
The spelling of 132008449 in words is "one hundred thirty-two million, eight thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •