Base | Representation |
---|---|
bin | 111101100001011000… |
… | …0101100011000001000 |
3 | 110122000102121210212020 |
4 | 1323002300230120020 |
5 | 4131033320012324 |
6 | 140405444244440 |
7 | 12354654155214 |
oct | 1730260543010 |
9 | 418012553766 |
10 | 132116563464 |
11 | 510373a0636 |
12 | 217316a0720 |
13 | c5c6541852 |
14 | 6574627944 |
15 | 3683a9d679 |
hex | 1ec2c2c608 |
132116563464 has 128 divisors (see below), whose sum is σ = 341158625280. Its totient is φ = 42613222400.
The previous prime is 132116563463. The next prime is 132116563519. The reversal of 132116563464 is 464365611231.
It is a happy number.
132116563464 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (132116563463) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 62583769 + ... + 62585879.
It is an arithmetic number, because the mean of its divisors is an integer number (2665301760).
Almost surely, 2132116563464 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 132116563464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170579312640).
132116563464 is an abundant number, since it is smaller than the sum of its proper divisors (209042061816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132116563464 is a wasteful number, since it uses less digits than its factorization.
132116563464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2771 (or 2767 counting only the distinct ones).
The product of its digits is 311040, while the sum is 42.
The spelling of 132116563464 in words is "one hundred thirty-two billion, one hundred sixteen million, five hundred sixty-three thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •