Base | Representation |
---|---|
bin | 1111110000110… |
… | …11001101001101 |
3 | 100012211002012222 |
4 | 13320123031031 |
5 | 232322411023 |
6 | 21042105125 |
7 | 3163645034 |
oct | 770331515 |
9 | 305732188 |
10 | 132232013 |
11 | 68706961 |
12 | 3834b1a5 |
13 | 2151a6c4 |
14 | 137c171b |
15 | b91ecc8 |
hex | 7e1b34d |
132232013 has 2 divisors, whose sum is σ = 132232014. Its totient is φ = 132232012.
The previous prime is 132231997. The next prime is 132232021. The reversal of 132232013 is 310232231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72216004 + 60016009 = 8498^2 + 7747^2 .
It is an emirp because it is prime and its reverse (310232231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132232013 - 24 = 132231997 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132231982 and 132232000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132232063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66116006 + 66116007.
It is an arithmetic number, because the mean of its divisors is an integer number (66116007).
Almost surely, 2132232013 is an apocalyptic number.
It is an amenable number.
132232013 is a deficient number, since it is larger than the sum of its proper divisors (1).
132232013 is an equidigital number, since it uses as much as digits as its factorization.
132232013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 132232013 is about 11499.2179299290. The cubic root of 132232013 is about 509.4624773696.
Adding to 132232013 its reverse (310232231), we get a palindrome (442464244).
The spelling of 132232013 in words is "one hundred thirty-two million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •