Base | Representation |
---|---|
bin | 111101100010100111… |
… | …1001000100101100100 |
3 | 110122010022202222012122 |
4 | 1323011033020211210 |
5 | 4131124433112024 |
6 | 140413530405112 |
7 | 12356000203400 |
oct | 1730517104544 |
9 | 418108688178 |
10 | 132158097764 |
11 | 51058889a00 |
12 | 21743590798 |
13 | c602024864 |
14 | 6579d5a100 |
15 | 3687554d5e |
hex | 1ec53c8964 |
132158097764 has 216 divisors, whose sum is σ = 321356770560. Its totient is φ = 47201616000.
The previous prime is 132158097703. The next prime is 132158097779. The reversal of 132158097764 is 467790851231.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 13963994 + ... + 13973454.
It is a 1-persistent number, because it is pandigital, but 2⋅132158097764 = 264316195528 is not.
Almost surely, 2132158097764 is an apocalyptic number.
132158097764 is a gapful number since it is divisible by the number (14) 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 132158097764, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160678385280).
132158097764 is an abundant number, since it is smaller than the sum of its proper divisors (189198672796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132158097764 is a wasteful number, since it uses less digits than its factorization.
132158097764 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9551 (or 9531 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 53.
It can be divided in two parts, 1321 and 58097764, that added together give a palindrome (58099085).
The spelling of 132158097764 in words is "one hundred thirty-two billion, one hundred fifty-eight million, ninety-seven thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •