Base | Representation |
---|---|
bin | 111101100101101101… |
… | …000111111101011001 |
3 | 20022200202211121111202 |
4 | 331211231013331121 |
5 | 2040413443243322 |
6 | 50214033203545 |
7 | 4530532562015 |
oct | 754555077531 |
9 | 208622747452 |
10 | 66130837337 |
11 | 26056151984 |
12 | 109971005b5 |
13 | 630b9758a6 |
14 | 32b4bdd545 |
15 | 1ac0ad2292 |
hex | f65b47f59 |
66130837337 has 8 divisors (see below), whose sum is σ = 66787374696. Its totient is φ = 65475551232.
The previous prime is 66130837319. The next prime is 66130837361. The reversal of 66130837337 is 73373803166.
It can be written as a sum of positive squares in 4 ways, for example, as 17138999056 + 48991838281 = 130916^2 + 221341^2 .
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 66130837337 - 28 = 66130837081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66130837291 and 66130837300.
It is not an unprimeable number, because it can be changed into a prime (66130831337) 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, 206408 + ... + 418169.
It is an arithmetic number, because the mean of its divisors is an integer number (8348421837).
Almost surely, 266130837337 is an apocalyptic number.
It is an amenable number.
66130837337 is a deficient number, since it is larger than the sum of its proper divisors (656537359).
66130837337 is a wasteful number, since it uses less digits than its factorization.
66130837337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625627.
The product of its (nonzero) digits is 1143072, while the sum is 47.
The spelling of 66130837337 in words is "sixty-six billion, one hundred thirty million, eight hundred thirty-seven thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •