Base | Representation |
---|---|
bin | 1111110100110… |
… | …01011100101101 |
3 | 100020210100112101 |
4 | 13322121130231 |
5 | 232440432401 |
6 | 21101135101 |
7 | 3201230422 |
oct | 772313455 |
9 | 306710471 |
10 | 132749101 |
11 | 68a2a401 |
12 | 3855a491 |
13 | 2166bb84 |
14 | 138b7d49 |
15 | b9c3101 |
hex | 7e9972d |
132749101 has 2 divisors, whose sum is σ = 132749102. Its totient is φ = 132749100.
The previous prime is 132749093. The next prime is 132749129. The reversal of 132749101 is 101947231.
It is an a-pointer prime, because the next prime (132749129) can be obtained adding 132749101 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132273001 + 476100 = 11501^2 + 690^2 .
It is a cyclic number.
It is not a de Polignac number, because 132749101 - 23 = 132749093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132749101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132749171) 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 as a sum of consecutive naturals, namely, 66374550 + 66374551.
It is an arithmetic number, because the mean of its divisors is an integer number (66374551).
Almost surely, 2132749101 is an apocalyptic number.
It is an amenable number.
132749101 is a deficient number, since it is larger than the sum of its proper divisors (1).
132749101 is an equidigital number, since it uses as much as digits as its factorization.
132749101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 132749101 is about 11521.6796084599. The cubic root of 132749101 is about 510.1256911786.
The spelling of 132749101 in words is "one hundred thirty-two million, seven hundred forty-nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •