Base | Representation |
---|---|
bin | 1111110010111… |
… | …01100111110101 |
3 | 100020022220101112 |
4 | 13321131213311 |
5 | 232410112203 |
6 | 21052004405 |
7 | 3166160123 |
oct | 771354765 |
9 | 306286345 |
10 | 132504053 |
11 | 68882290 |
12 | 38460705 |
13 | 215b4486 |
14 | 13852913 |
15 | b9756d8 |
hex | 7e5d9f5 |
132504053 has 8 divisors (see below), whose sum is σ = 145689600. Its totient is φ = 119508480.
The previous prime is 132504023. The next prime is 132504059. The reversal of 132504053 is 350405231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132504053 - 210 = 132503029 is a prime.
It is a super-2 number, since 2×1325040532 = 35114648122853618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132504059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46028 + ... + 48821.
It is an arithmetic number, because the mean of its divisors is an integer number (18211200).
Almost surely, 2132504053 is an apocalyptic number.
It is an amenable number.
132504053 is a deficient number, since it is larger than the sum of its proper divisors (13185547).
132504053 is a wasteful number, since it uses less digits than its factorization.
132504053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94987.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 132504053 is about 11511.0404829451. The cubic root of 132504053 is about 509.8116092597.
Adding to 132504053 its reverse (350405231), we get a palindrome (482909284).
The spelling of 132504053 in words is "one hundred thirty-two million, five hundred four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •