Base | Representation |
---|---|
bin | 11110000111100000110100… |
… | …011001110011010011011000 |
3 | 122100222211101210210220101220 |
4 | 132013200310121303103120 |
5 | 114330141302132300413 |
6 | 1145414114104012040 |
7 | 36620515362053502 |
oct | 3607406431632330 |
9 | 570884353726356 |
10 | 132457670587608 |
11 | 39228a89978463 |
12 | 12a33225a61020 |
13 | 58ba921412232 |
14 | 249cdb217ad72 |
15 | 104a7dbe41223 |
hex | 7878346734d8 |
132457670587608 has 64 divisors (see below), whose sum is σ = 355856428517760. Its totient is φ = 40935118557696.
The previous prime is 132457670587579. The next prime is 132457670587637. The reversal of 132457670587608 is 806785076754231.
It is an interprime number because it is at equal distance from previous prime (132457670587579) and next prime (132457670587637).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2422742466 + ... + 2422797137.
It is an arithmetic number, because the mean of its divisors is an integer number (5560256695590).
Almost surely, 2132457670587608 is an apocalyptic number.
It is an amenable number.
132457670587608 is an abundant number, since it is smaller than the sum of its proper divisors (223398757930152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132457670587608 is a wasteful number, since it uses less digits than its factorization.
132457670587608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4845539696 (or 4845539692 counting only the distinct ones).
The product of its (nonzero) digits is 474163200, while the sum is 69.
The spelling of 132457670587608 in words is "one hundred thirty-two trillion, four hundred fifty-seven billion, six hundred seventy million, five hundred eighty-seven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •