Base | Representation |
---|---|
bin | 111101110010111101… |
… | …0111010010010110101 |
3 | 110200112112120212110212 |
4 | 1323211322322102311 |
5 | 4133240322210334 |
6 | 140544155355205 |
7 | 12405406111004 |
oct | 1734572722265 |
9 | 420475525425 |
10 | 132706444469 |
11 | 5130a3679a5 |
12 | 21877152b05 |
13 | c68b806671 |
14 | 65ccad8c3b |
15 | 36ba76cece |
hex | 1ee5eba4b5 |
132706444469 has 8 divisors (see below), whose sum is σ = 137511538560. Its totient is φ = 127979482176.
The previous prime is 132706444459. The next prime is 132706444477. The reversal of 132706444469 is 964444607231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132706444469 is a prime.
It is a super-2 number, since 2×1327064444692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132706444459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19529492 + ... + 19536285.
It is an arithmetic number, because the mean of its divisors is an integer number (17188942320).
Almost surely, 2132706444469 is an apocalyptic number.
It is an amenable number.
132706444469 is a deficient number, since it is larger than the sum of its proper divisors (4805094091).
132706444469 is an equidigital number, since it uses as much as digits as its factorization.
132706444469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39065899.
The product of its (nonzero) digits is 3483648, while the sum is 50.
The spelling of 132706444469 in words is "one hundred thirty-two billion, seven hundred six million, four hundred forty-four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •