Base | Representation |
---|---|
bin | 1111101111001… |
… | …01000011100101 |
3 | 100012101210222011 |
4 | 13313211003211 |
5 | 232243311323 |
6 | 21033234221 |
7 | 3162032266 |
oct | 767450345 |
9 | 305353864 |
10 | 132010213 |
11 | 68575255 |
12 | 38262971 |
13 | 2147076a |
14 | 1376496d |
15 | b8c920d |
hex | 7de50e5 |
132010213 has 2 divisors, whose sum is σ = 132010214. Its totient is φ = 132010212.
The previous prime is 132010211. The next prime is 132010231. The reversal of 132010213 is 312010231.
Together with next prime (132010231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131836324 + 173889 = 11482^2 + 417^2 .
It is a cyclic number.
It is not a de Polignac number, because 132010213 - 21 = 132010211 is a prime.
Together with 132010211, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 132010193 and 132010202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132010211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66005106 + 66005107.
It is an arithmetic number, because the mean of its divisors is an integer number (66005107).
Almost surely, 2132010213 is an apocalyptic number.
It is an amenable number.
132010213 is a deficient number, since it is larger than the sum of its proper divisors (1).
132010213 is an equidigital number, since it uses as much as digits as its factorization.
132010213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 132010213 is about 11489.5697482543. The cubic root of 132010213 is about 509.1774681813.
Adding to 132010213 its reverse (312010231), we get a palindrome (444020444).
The spelling of 132010213 in words is "one hundred thirty-two million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •