Base | Representation |
---|---|
bin | 11110001100100011101101… |
… | …101010000110001000010001 |
3 | 122102012222022022021010011020 |
4 | 132030203231222012020101 |
5 | 114401331330230341130 |
6 | 1150241253232510053 |
7 | 36654541145504646 |
oct | 3614435552061021 |
9 | 572188268233136 |
10 | 132804376027665 |
11 | 393520240790a1 |
12 | 12a8a4649ab329 |
13 | 59145255846b4 |
14 | 24b1aa224bdcd |
15 | 105482eb18e10 |
hex | 78c8eda86211 |
132804376027665 has 16 divisors (see below), whose sum is σ = 214549982245248. Its totient is φ = 70141340347776.
The previous prime is 132804376027663. The next prime is 132804376027669. The reversal of 132804376027665 is 566720673408231.
It is a happy number.
It is not a de Polignac number, because 132804376027665 - 21 = 132804376027663 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132804376027599 and 132804376027608.
It is not an unprimeable number, because it can be changed into a prime (132804376027663) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42978760924 + ... + 42978764013.
It is an arithmetic number, because the mean of its divisors is an integer number (13409373890328).
Almost surely, 2132804376027665 is an apocalyptic number.
132804376027665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132804376027665 is a deficient number, since it is larger than the sum of its proper divisors (81745606217583).
132804376027665 is a wasteful number, since it uses less digits than its factorization.
132804376027665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85957525048.
The product of its (nonzero) digits is 60963840, while the sum is 60.
The spelling of 132804376027665 in words is "one hundred thirty-two trillion, eight hundred four billion, three hundred seventy-six million, twenty-seven thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •