Base | Representation |
---|---|
bin | 111101110100100010… |
… | …0111011001000001011 |
3 | 110200200020020100010210 |
4 | 1323221010323020023 |
5 | 4133342401312341 |
6 | 140553330412203 |
7 | 12406621201101 |
oct | 1735104731013 |
9 | 420606210123 |
10 | 132759400971 |
11 | 513372479aa |
12 | 21890a31063 |
13 | c699788682 |
14 | 65d5b61c71 |
15 | 36c022dc16 |
hex | 1ee913b20b |
132759400971 has 16 divisors (see below), whose sum is σ = 177545136384. Its totient is φ = 88240123104.
The previous prime is 132759400931. The next prime is 132759401023. The reversal of 132759400971 is 179004957231.
It is not a de Polignac number, because 132759400971 - 27 = 132759400843 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132759400971.
It is not an unprimeable number, because it can be changed into a prime (132759400901) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3727570 + ... + 3763016.
It is an arithmetic number, because the mean of its divisors is an integer number (11096571024).
Almost surely, 2132759400971 is an apocalyptic number.
132759400971 is a deficient number, since it is larger than the sum of its proper divisors (44785735413).
132759400971 is a wasteful number, since it uses less digits than its factorization.
132759400971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39170.
The product of its (nonzero) digits is 476280, while the sum is 48.
The spelling of 132759400971 in words is "one hundred thirty-two billion, seven hundred fifty-nine million, four hundred thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •