Base | Representation |
---|---|
bin | 1111110011110… |
… | …00000010111001 |
3 | 100020112101211222 |
4 | 13321320002321 |
5 | 232422043111 |
6 | 21054201425 |
7 | 3200120504 |
oct | 771700271 |
9 | 306471758 |
10 | 132612281 |
11 | 6894662a |
12 | 384b3275 |
13 | 21621809 |
14 | 1388013b |
15 | b9977db |
hex | 7e780b9 |
132612281 has 2 divisors, whose sum is σ = 132612282. Its totient is φ = 132612280.
The previous prime is 132612253. The next prime is 132612283. The reversal of 132612281 is 182216231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109725625 + 22886656 = 10475^2 + 4784^2 .
It is a cyclic number.
It is not a de Polignac number, because 132612281 - 222 = 128417977 is a prime.
It is a super-2 number, since 2×1326122812 = 35172034144045922, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 132612283, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 132612281.
It is not a weakly prime, because it can be changed into another prime (132612283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66306140 + 66306141.
It is an arithmetic number, because the mean of its divisors is an integer number (66306141).
Almost surely, 2132612281 is an apocalyptic number.
It is an amenable number.
132612281 is a deficient number, since it is larger than the sum of its proper divisors (1).
132612281 is an equidigital number, since it uses as much as digits as its factorization.
132612281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 26.
The square root of 132612281 is about 11515.7405754037. The cubic root of 132612281 is about 509.9503745126.
The spelling of 132612281 in words is "one hundred thirty-two million, six hundred twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •