Base | Representation |
---|---|
bin | 111101100110100100… |
… | …0000001001001110000 |
3 | 110122110112211011101111 |
4 | 1323031020001021300 |
5 | 4131412323400112 |
6 | 140435015243104 |
7 | 12362165162146 |
oct | 1731510011160 |
9 | 418415734344 |
10 | 132290450032 |
11 | 51116568144 |
12 | 2177b979494 |
13 | c623584c00 |
14 | 658d76d596 |
15 | 3693e9a5a7 |
hex | 1ecd201270 |
132290450032 has 60 divisors (see below), whose sum is σ = 286499025984. Its totient is φ = 59087508480.
The previous prime is 132290450021. The next prime is 132290450041. The reversal of 132290450032 is 230054092231.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 132290449976 and 132290450003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 705273 + ... + 872920.
Almost surely, 2132290450032 is an apocalyptic number.
It is an amenable number.
132290450032 is an abundant number, since it is smaller than the sum of its proper divisors (154208575952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132290450032 is a wasteful number, since it uses less digits than its factorization.
132290450032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1578258 (or 1578239 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
The spelling of 132290450032 in words is "one hundred thirty-two billion, two hundred ninety million, four hundred fifty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •