Base | Representation |
---|---|
bin | 111101111111100101… |
… | …010110010100111001 |
3 | 20100211000210200211122 |
4 | 331333211112110321 |
5 | 2042311120203044 |
6 | 50325103035025 |
7 | 4544354135531 |
oct | 757745262471 |
9 | 210730720748 |
10 | 66565006649 |
11 | 26259235799 |
12 | 10a9859ba75 |
13 | 637a8bbacb |
14 | 331673a4c1 |
15 | 1ae8c94dee |
hex | f7f956539 |
66565006649 has 8 divisors (see below), whose sum is σ = 68715237888. Its totient is φ = 64414961280.
The previous prime is 66565006631. The next prime is 66565006663. The reversal of 66565006649 is 94660056566.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66565006649 is a prime.
It is a super-2 number, since 2×665650066492 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 66565006649.
It is not an unprimeable number, because it can be changed into a prime (66565006549) 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, 1314569 + ... + 1364265.
It is an arithmetic number, because the mean of its divisors is an integer number (8589404736).
Almost surely, 266565006649 is an apocalyptic number.
It is an amenable number.
66565006649 is a deficient number, since it is larger than the sum of its proper divisors (2150231239).
66565006649 is a wasteful number, since it uses less digits than its factorization.
66565006649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92935.
The product of its (nonzero) digits is 6998400, while the sum is 53.
The spelling of 66565006649 in words is "sixty-six billion, five hundred sixty-five million, six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •