Base | Representation |
---|---|
bin | 1111110011110… |
… | …11010001000000 |
3 | 100020120001221112 |
4 | 13321323101000 |
5 | 232423003342 |
6 | 21054342452 |
7 | 3200204120 |
oct | 771732100 |
9 | 306501845 |
10 | 132625472 |
11 | 68955531 |
12 | 384baa28 |
13 | 21627815 |
14 | 13884c80 |
15 | b99b682 |
hex | 7e7b440 |
132625472 has 56 divisors (see below), whose sum is σ = 316626240. Its totient is φ = 53844480.
The previous prime is 132625469. The next prime is 132625477. The reversal of 132625472 is 274526231.
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (132625477) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 722 + ... + 16302.
It is an arithmetic number, because the mean of its divisors is an integer number (5654040).
Almost surely, 2132625472 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 132625472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158313120).
132625472 is an abundant number, since it is smaller than the sum of its proper divisors (184000768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132625472 is a wasteful number, since it uses less digits than its factorization.
132625472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15619 (or 15609 counting only the distinct ones).
The product of its digits is 20160, while the sum is 32.
The square root of 132625472 is about 11516.3132989686. The cubic root of 132625472 is about 509.9672822789.
The spelling of 132625472 in words is "one hundred thirty-two million, six hundred twenty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •