Base | Representation |
---|---|
bin | 111101011111110101… |
… | …1001010100001110011 |
3 | 110121212211012001122221 |
4 | 1322333223022201303 |
5 | 4130432041014301 |
6 | 140400354341511 |
7 | 12353455062160 |
oct | 1727753124163 |
9 | 417784161587 |
10 | 132064782451 |
11 | 51010143808 |
12 | 2171828a897 |
13 | c5b88b18b4 |
14 | 656b7c9067 |
15 | 367e270da1 |
hex | 1ebfaca873 |
132064782451 has 8 divisors (see below), whose sum is σ = 151073442144. Its totient is φ = 113091688320.
The previous prime is 132064782439. The next prime is 132064782469. The reversal of 132064782451 is 154287460231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132064782451 - 217 = 132064651379 is a prime.
It is a super-2 number, since 2×1320647824512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132064782398 and 132064782407.
It is not an unprimeable number, because it can be changed into a prime (132064782851) 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, 8883430 + ... + 8898283.
It is an arithmetic number, because the mean of its divisors is an integer number (18884180268).
Almost surely, 2132064782451 is an apocalyptic number.
132064782451 is a deficient number, since it is larger than the sum of its proper divisors (19008659693).
132064782451 is a wasteful number, since it uses less digits than its factorization.
132064782451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17782781.
The product of its (nonzero) digits is 322560, while the sum is 43.
The spelling of 132064782451 in words is "one hundred thirty-two billion, sixty-four million, seven hundred eighty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •