Base | Representation |
---|---|
bin | 111101110001001001… |
… | …0111111001011000000 |
3 | 110200101022012001002020 |
4 | 1323202102333023000 |
5 | 4133124241201130 |
6 | 140534144321440 |
7 | 12404040253014 |
oct | 1734222771300 |
9 | 420338161066 |
10 | 132645647040 |
11 | 51289011995 |
12 | 2185a913280 |
13 | c67c03a75a |
14 | 65c49d0544 |
15 | 36b525de10 |
hex | 1ee24bf2c0 |
132645647040 has 224 divisors, whose sum is σ = 460309837824. Its totient is φ = 32217415680.
The previous prime is 132645647011. The next prime is 132645647051. The reversal of 132645647040 is 40746546231.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 132645646983 and 132645647001.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 374827 + ... + 637013.
Almost surely, 2132645647040 is an apocalyptic number.
132645647040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132645647040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (230154918912).
132645647040 is an abundant number, since it is smaller than the sum of its proper divisors (327664190784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132645647040 is a wasteful number, since it uses less digits than its factorization.
132645647040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262255 (or 262245 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 42.
The spelling of 132645647040 in words is "one hundred thirty-two billion, six hundred forty-five million, six hundred forty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •