Base | Representation |
---|---|
bin | 1111110000100… |
… | …11111000011101 |
3 | 100012202120001212 |
4 | 13320103320131 |
5 | 232320431023 |
6 | 21041314205 |
7 | 3163461416 |
oct | 770237035 |
9 | 305676055 |
10 | 132202013 |
11 | 68696369 |
12 | 38335965 |
13 | 21509b58 |
14 | 137b480d |
15 | b915e78 |
hex | 7e13e1d |
132202013 has 4 divisors (see below), whose sum is σ = 139978620. Its totient is φ = 124425408.
The previous prime is 132202009. The next prime is 132202033. The reversal of 132202013 is 310202231.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 310202231 = 1879 ⋅165089.
It can be written as a sum of positive squares in 2 ways, for example, as 37295449 + 94906564 = 6107^2 + 9742^2 .
It is a cyclic number.
It is not a de Polignac number, because 132202013 - 22 = 132202009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132202033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3888278 + ... + 3888311.
It is an arithmetic number, because the mean of its divisors is an integer number (34994655).
Almost surely, 2132202013 is an apocalyptic number.
It is an amenable number.
132202013 is a deficient number, since it is larger than the sum of its proper divisors (7776607).
132202013 is an equidigital number, since it uses as much as digits as its factorization.
132202013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7776606.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 132202013 is about 11497.9134193992. The cubic root of 132202013 is about 509.4239465329.
Adding to 132202013 its reverse (310202231), we get a palindrome (442404244).
The spelling of 132202013 in words is "one hundred thirty-two million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •