Base | Representation |
---|---|
bin | 111101101000101110… |
… | …0000011000010010001 |
3 | 110122122120222101220101 |
4 | 1323101130003002101 |
5 | 4132034334400424 |
6 | 140450122212401 |
7 | 12364034213521 |
oct | 1732134030221 |
9 | 418576871811 |
10 | 132362809489 |
11 | 5115339a949 |
12 | 217a0054101 |
13 | c63556b661 |
14 | 6599207681 |
15 | 369a4e0344 |
hex | 1ed1703091 |
132362809489 has 9 divisors (see below), whose sum is σ = 140613430321. Its totient is φ = 124570940800.
The previous prime is 132362809451. The next prime is 132362809493. The reversal of 132362809489 is 984908263231.
The square root of 132362809489 is 363817.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 18190225 + 132344619264 = 4265^2 + 363792^2 .
It is not a de Polignac number, because 132362809489 - 219 = 132362285201 is a prime.
It is a super-2 number, since 2×1323628094892 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132362809429) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6174189 + ... + 6195589.
Almost surely, 2132362809489 is an apocalyptic number.
132362809489 is the 363817-th square number.
132362809489 is the 181909-th centered octagonal number.
It is an amenable number.
132362809489 is a deficient number, since it is larger than the sum of its proper divisors (8250620832).
132362809489 is an frugal number, since it uses more digits than its factorization.
132362809489 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42836 (or 21418 counting only the distinct ones).
The product of its (nonzero) digits is 4478976, while the sum is 55.
The spelling of 132362809489 in words is "one hundred thirty-two billion, three hundred sixty-two million, eight hundred nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •