Base | Representation |
---|---|
bin | 1111110011011… |
… | …00010101101101 |
3 | 100020102222002010 |
4 | 13321230111231 |
5 | 232414024313 |
6 | 21053151433 |
7 | 3166530636 |
oct | 771542555 |
9 | 306388063 |
10 | 132564333 |
11 | 68913600 |
12 | 3848b579 |
13 | 21605a45 |
14 | 1386a88d |
15 | b9884c3 |
hex | 7e6c56d |
132564333 has 24 divisors (see below), whose sum is σ = 196154784. Its totient is φ = 79567840.
The previous prime is 132564323. The next prime is 132564359. The reversal of 132564333 is 333465231.
It is not a de Polignac number, because 132564333 - 218 = 132302189 is a 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 132564333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132564323) 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 23 ways as a sum of consecutive naturals, for example, 37135 + ... + 40547.
It is an arithmetic number, because the mean of its divisors is an integer number (8173116).
Almost surely, 2132564333 is an apocalyptic number.
It is an amenable number.
132564333 is a deficient number, since it is larger than the sum of its proper divisors (63590451).
132564333 is a wasteful number, since it uses less digits than its factorization.
132564333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3545 (or 3534 counting only the distinct ones).
The product of its digits is 19440, while the sum is 30.
The square root of 132564333 is about 11513.6585410546. The cubic root of 132564333 is about 509.8889069827. Note that the first 3 decimals are identical.
It can be divided in two parts, 132 and 564333, that added together give a palindrome (564465).
The spelling of 132564333 in words is "one hundred thirty-two million, five hundred sixty-four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •