Base | Representation |
---|---|
bin | 111110000000101110… |
… | …011111110101111101 |
3 | 20100212100212220200001 |
4 | 332000232133311331 |
5 | 2042331022312031 |
6 | 50331030034301 |
7 | 4545006132001 |
oct | 760056376575 |
9 | 210770786601 |
10 | 66584182141 |
11 | 26269042604 |
12 | 10aa2aa8991 |
13 | 6381873b59 |
14 | 33190cc701 |
15 | 1aea7d1861 |
hex | f80b9fd7d |
66584182141 has 8 divisors (see below), whose sum is σ = 70091625600. Its totient is φ = 63077040000.
The previous prime is 66584182139. The next prime is 66584182157. The reversal of 66584182141 is 14128148566.
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 66584182141 - 21 = 66584182139 is a prime.
It is a super-2 number, since 2×665841821412 (a number of 22 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 = 66584182091 and 66584182100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66584182111) 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, 485325 + ... + 607213.
It is an arithmetic number, because the mean of its divisors is an integer number (8761453200).
Almost surely, 266584182141 is an apocalyptic number.
It is an amenable number.
66584182141 is a deficient number, since it is larger than the sum of its proper divisors (3507443459).
66584182141 is a wasteful number, since it uses less digits than its factorization.
66584182141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150659.
The product of its digits is 368640, while the sum is 46.
The spelling of 66584182141 in words is "sixty-six billion, five hundred eighty-four million, one hundred eighty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •