Base | Representation |
---|---|
bin | 11110000001111111110010… |
… | …110110000000001100000100 |
3 | 122022122120222200010212111121 |
4 | 132001333302312000030010 |
5 | 114302434000032441431 |
6 | 1144524024420243324 |
7 | 36551236112362264 |
oct | 3601776266001404 |
9 | 568576880125447 |
10 | 132078613562116 |
11 | 390a2253089861 |
12 | 12991878540544 |
13 | 5890c62940900 |
14 | 24888d36057a4 |
15 | 1040a03e7d611 |
hex | 781ff2d80304 |
132078613562116 has 81 divisors (see below), whose sum is σ = 256562267042109. Its totient is φ = 59467030022400.
The previous prime is 132078613562101. The next prime is 132078613562117. The reversal of 132078613562116 is 611265316870231.
The square root of 132078613562116 is 11492546.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 113104713904900 + 18973899657216 = 10635070^2 + 4355904^2 .
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132078613562117) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 12251048646 + ... + 12251059426.
Almost surely, 2132078613562116 is an apocalyptic number.
132078613562116 is the 11492546-th square number.
It is an amenable number.
132078613562116 is a deficient number, since it is larger than the sum of its proper divisors (124483653479993).
132078613562116 is an frugal number, since it uses more digits than its factorization.
132078613562116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21674 (or 10837 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 52.
The spelling of 132078613562116 in words is "one hundred thirty-two trillion, seventy-eight billion, six hundred thirteen million, five hundred sixty-two thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •