Base | Representation |
---|---|
bin | 111101010011001110… |
… | …1001001010011111111 |
3 | 110120210100001002011201 |
4 | 1322212131021103333 |
5 | 4124100232131210 |
6 | 140250402000331 |
7 | 12340126535560 |
oct | 1724635112377 |
9 | 416710032151 |
10 | 131641677055 |
11 | 50913327429 |
12 | 2161a6460a7 |
13 | c54c040585 |
14 | 652b52c167 |
15 | 365704653a |
hex | 1ea67494ff |
131641677055 has 16 divisors (see below), whose sum is σ = 180553927680. Its totient is φ = 90260193312.
The previous prime is 131641677001. The next prime is 131641677073. The reversal of 131641677055 is 550776146131.
It is a cyclic number.
It is not a de Polignac number, because 131641677055 - 27 = 131641676927 is a prime.
It is a super-2 number, since 2×1316416770552 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131641676996 and 131641677014.
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, 220032 + ... + 558298.
It is an arithmetic number, because the mean of its divisors is an integer number (11284620480).
Almost surely, 2131641677055 is an apocalyptic number.
131641677055 is a deficient number, since it is larger than the sum of its proper divisors (48912250625).
131641677055 is a wasteful number, since it uses less digits than its factorization.
131641677055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349398.
The product of its (nonzero) digits is 529200, while the sum is 46.
The spelling of 131641677055 in words is "one hundred thirty-one billion, six hundred forty-one million, six hundred seventy-seven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •