Base | Representation |
---|---|
bin | 1111110011000… |
… | …00010010011000 |
3 | 100020100110100210 |
4 | 13321200102120 |
5 | 232410434333 |
6 | 21052131120 |
7 | 3166234005 |
oct | 771402230 |
9 | 306313323 |
10 | 132514968 |
11 | 6888a503 |
12 | 38466aa0 |
13 | 215b9431 |
14 | 138568ac |
15 | b978a63 |
hex | 7e60498 |
132514968 has 64 divisors (see below), whose sum is σ = 353721600. Its totient is φ = 41247360.
The previous prime is 132514961. The next prime is 132514969. The reversal of 132514968 is 869415231.
It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132514961) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30330 + ... + 34422.
It is an arithmetic number, because the mean of its divisors is an integer number (5526900).
Almost surely, 2132514968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132514968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176860800).
132514968 is an abundant number, since it is smaller than the sum of its proper divisors (221206632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132514968 is a wasteful number, since it uses less digits than its factorization.
132514968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4192 (or 4188 counting only the distinct ones).
The product of its digits is 51840, while the sum is 39.
The square root of 132514968 is about 11511.5145832336. The cubic root of 132514968 is about 509.8256074250.
The spelling of 132514968 in words is "one hundred thirty-two million, five hundred fourteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •