Base | Representation |
---|---|
bin | 1111101111000… |
… | …11001101010101 |
3 | 100012101102120212 |
4 | 13313203031111 |
5 | 232243041040 |
6 | 21033135205 |
7 | 3162001235 |
oct | 767431525 |
9 | 305342525 |
10 | 132002645 |
11 | 6856a5a5 |
12 | 3825a505 |
13 | 2146a198 |
14 | 13761cc5 |
15 | b8c6d65 |
hex | 7de3355 |
132002645 has 16 divisors (see below), whose sum is σ = 160876800. Its totient is φ = 103966464.
The previous prime is 132002641. The next prime is 132002659. The reversal of 132002645 is 546200231.
It is a cyclic number.
It is not a de Polignac number, because 132002645 - 22 = 132002641 is a prime.
It is a super-3 number, since 3×1320026453 (a number of 25 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132002645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132002641) 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 15 ways as a sum of consecutive naturals, for example, 93656 + ... + 95054.
It is an arithmetic number, because the mean of its divisors is an integer number (10054800).
Almost surely, 2132002645 is an apocalyptic number.
It is an amenable number.
132002645 is a deficient number, since it is larger than the sum of its proper divisors (28874155).
132002645 is a wasteful number, since it uses less digits than its factorization.
132002645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1684.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 132002645 is about 11489.2404013494. The cubic root of 132002645 is about 509.1677378010.
Adding to 132002645 its reverse (546200231), we get a palindrome (678202876).
The spelling of 132002645 in words is "one hundred thirty-two million, two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •