Base | Representation |
---|---|
bin | 1111101111111… |
… | …01100001110101 |
3 | 100012120220110202 |
4 | 13313331201311 |
5 | 232310013303 |
6 | 21035330245 |
7 | 3162630446 |
oct | 767754165 |
9 | 305526422 |
10 | 132110453 |
11 | 686335a2 |
12 | 382b0985 |
13 | 214a7287 |
14 | 1378d2cd |
15 | b8e8c88 |
hex | 7dfd875 |
132110453 has 2 divisors, whose sum is σ = 132110454. Its totient is φ = 132110452.
The previous prime is 132110431. The next prime is 132110471. The reversal of 132110453 is 354011231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118875409 + 13235044 = 10903^2 + 3638^2 .
It is a cyclic number.
It is not a de Polignac number, because 132110453 - 218 = 131848309 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132110483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66055226 + 66055227.
It is an arithmetic number, because the mean of its divisors is an integer number (66055227).
Almost surely, 2132110453 is an apocalyptic number.
It is an amenable number.
132110453 is a deficient number, since it is larger than the sum of its proper divisors (1).
132110453 is an equidigital number, since it uses as much as digits as its factorization.
132110453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 132110453 is about 11493.9311377788. The cubic root of 132110453 is about 509.3063143639.
Adding to 132110453 its reverse (354011231), we get a palindrome (486121684).
The spelling of 132110453 in words is "one hundred thirty-two million, one hundred ten thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •