Base | Representation |
---|---|
bin | 1111110000101… |
… | …01101011110101 |
3 | 100012202221012100 |
4 | 13320111223311 |
5 | 232321200042 |
6 | 21041412313 |
7 | 3163522065 |
oct | 770255365 |
9 | 305687170 |
10 | 132209397 |
11 | 686a0971 |
12 | 3833a099 |
13 | 21510318 |
14 | 137b73a5 |
15 | b91824c |
hex | 7e15af5 |
132209397 has 12 divisors (see below), whose sum is σ = 191400300. Its totient is φ = 87940608.
The previous prime is 132209377. The next prime is 132209417. The reversal of 132209397 is 793902231.
It is an interprime number because it is at equal distance from previous prime (132209377) and next prime (132209417).
It can be written as a sum of positive squares in 2 ways, for example, as 103917636 + 28291761 = 10194^2 + 5319^2 .
It is not a de Polignac number, because 132209397 - 211 = 132207349 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132209377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12318 + ... + 20399.
It is an arithmetic number, because the mean of its divisors is an integer number (15950025).
Almost surely, 2132209397 is an apocalyptic number.
It is an amenable number.
132209397 is a deficient number, since it is larger than the sum of its proper divisors (59190903).
132209397 is a wasteful number, since it uses less digits than its factorization.
132209397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33172 (or 33169 counting only the distinct ones).
The product of its (nonzero) digits is 20412, while the sum is 36.
The square root of 132209397 is about 11498.2345166552. The cubic root of 132209397 is about 509.4334307969.
The spelling of 132209397 in words is "one hundred thirty-two million, two hundred nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •