Base | Representation |
---|---|
bin | 111101101111111000… |
… | …1001100101101010101 |
3 | 110200021100101021220202 |
4 | 1323133301030231111 |
5 | 4133032412011112 |
6 | 140530031310245 |
7 | 12403013621141 |
oct | 1733761145525 |
9 | 420240337822 |
10 | 132603235157 |
11 | 51267084248 |
12 | 2184867b385 |
13 | c67330b173 |
14 | 65bd110221 |
15 | 36b16826c2 |
hex | 1edfc4cb55 |
132603235157 has 2 divisors, whose sum is σ = 132603235158. Its totient is φ = 132603235156.
The previous prime is 132603235109. The next prime is 132603235159. The reversal of 132603235157 is 751532306231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125674504036 + 6928731121 = 354506^2 + 83239^2 .
It is a cyclic number.
It is not a de Polignac number, because 132603235157 - 226 = 132536126293 is a prime.
Together with 132603235159, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132603235157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132603235159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66301617578 + 66301617579.
It is an arithmetic number, because the mean of its divisors is an integer number (66301617579).
Almost surely, 2132603235157 is an apocalyptic number.
It is an amenable number.
132603235157 is a deficient number, since it is larger than the sum of its proper divisors (1).
132603235157 is an equidigital number, since it uses as much as digits as its factorization.
132603235157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 38.
The spelling of 132603235157 in words is "one hundred thirty-two billion, six hundred three million, two hundred thirty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •