Base | Representation |
---|---|
bin | 1111110010011… |
… | …11010010110011 |
3 | 100020012220212211 |
4 | 13321033102303 |
5 | 232401222423 |
6 | 21050432551 |
7 | 3165524041 |
oct | 771172263 |
9 | 306186784 |
10 | 132445363 |
11 | 68842186 |
12 | 38432757 |
13 | 2159384b |
14 | 13839391 |
15 | b96310d |
hex | 7e4f4b3 |
132445363 has 4 divisors (see below), whose sum is σ = 132706080. Its totient is φ = 132184648.
The previous prime is 132445319. The next prime is 132445427. The reversal of 132445363 is 363544231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132445363 - 217 = 132314291 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132445303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129595 + ... + 130612.
It is an arithmetic number, because the mean of its divisors is an integer number (33176520).
Almost surely, 2132445363 is an apocalyptic number.
132445363 is a deficient number, since it is larger than the sum of its proper divisors (260717).
132445363 is an equidigital number, since it uses as much as digits as its factorization.
132445363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260716.
The product of its digits is 25920, while the sum is 31.
The square root of 132445363 is about 11508.4909088898. The cubic root of 132445363 is about 509.7363278844.
Adding to 132445363 its reverse (363544231), we get a palindrome (495989594).
The spelling of 132445363 in words is "one hundred thirty-two million, four hundred forty-five thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •