Base | Representation |
---|---|
bin | 111101110000111110… |
… | …1101011010100111001 |
3 | 110200100220200020002211 |
4 | 1323201331223110321 |
5 | 4133121323420404 |
6 | 140533424455121 |
7 | 12403641625261 |
oct | 1734175532471 |
9 | 420326606084 |
10 | 132640060729 |
11 | 51285946900 |
12 | 21858a7a4a1 |
13 | c67ab32b47 |
14 | 65c3d787a1 |
15 | 36b4a08b04 |
hex | 1ee1f6b539 |
132640060729 has 48 divisors (see below), whose sum is σ = 149551073280. Its totient is φ = 117528364800.
The previous prime is 132640060673. The next prime is 132640060783. The reversal of 132640060729 is 927060046231.
It is a happy number.
It is not a de Polignac number, because 132640060729 - 225 = 132606506297 is a prime.
It is a super-2 number, since 2×1326400607292 (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 = 132640060691 and 132640060700.
It is not an unprimeable number, because it can be changed into a prime (132640060229) 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 47 ways as a sum of consecutive naturals, for example, 400725094 + ... + 400725424.
It is an arithmetic number, because the mean of its divisors is an integer number (3115647360).
Almost surely, 2132640060729 is an apocalyptic number.
It is an amenable number.
132640060729 is a deficient number, since it is larger than the sum of its proper divisors (16911012551).
132640060729 is a wasteful number, since it uses less digits than its factorization.
132640060729 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862 (or 851 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 132640060729 in words is "one hundred thirty-two billion, six hundred forty million, sixty thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •