Base | Representation |
---|---|
bin | 10011010111101011110… |
… | …11110011110010111101 |
3 | 2100121220101201221020002 |
4 | 21223311323303302331 |
5 | 41401022032411112 |
6 | 1225425553004045 |
7 | 66040655445404 |
oct | 11536573636275 |
9 | 2317811657202 |
10 | 665551060157 |
11 | 23729324a285 |
12 | a8ba3853625 |
13 | 4a9b8468179 |
14 | 242da08263b |
15 | 124a4ac91c2 |
hex | 9af5ef3cbd |
665551060157 has 4 divisors (see below), whose sum is σ = 672140674716. Its totient is φ = 658961445600.
The previous prime is 665551060151. The next prime is 665551060193. The reversal of 665551060157 is 751060155566.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 646047820441 + 19503239716 = 803771^2 + 139654^2 .
It is a cyclic number.
It is not a de Polignac number, because 665551060157 - 212 = 665551056061 is a prime.
It is a super-2 number, since 2×6655510601572 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (665551060151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3294807128 + ... + 3294807329.
It is an arithmetic number, because the mean of its divisors is an integer number (168035168679).
Almost surely, 2665551060157 is an apocalyptic number.
It is an amenable number.
665551060157 is a deficient number, since it is larger than the sum of its proper divisors (6589614559).
665551060157 is a wasteful number, since it uses less digits than its factorization.
665551060157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6589614558.
The product of its (nonzero) digits is 945000, while the sum is 47.
The spelling of 665551060157 in words is "six hundred sixty-five billion, five hundred fifty-one million, sixty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.871 sec. • engine limits •