Base | Representation |
---|---|
bin | 101001001011111001000… |
… | …0001010001111011001001 |
3 | 202001010211020021012110221 |
4 | 1102113302001101323021 |
5 | 1220220232240210130 |
6 | 20012225045110041 |
7 | 1122650161050463 |
oct | 122276201217311 |
9 | 22033736235427 |
10 | 5660532350665 |
11 | 1892688a40045 |
12 | 7750709b8321 |
13 | 320a2a84c93a |
14 | 157d85097133 |
15 | 9c39b8ea87a |
hex | 525f2051ec9 |
5660532350665 has 8 divisors (see below), whose sum is σ = 6792966254088. Its totient is φ = 4528207591680.
The previous prime is 5660532350663. The next prime is 5660532350713.
5660532350665 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 1143521856 + 5659388828809 = 33816^2 + 2378947^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5660532350665 - 21 = 5660532350663 is a prime.
It is a super-4 number, since 4×56605323506654 (a number of 52 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5660532350663) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27171966 + ... + 27379495.
It is an arithmetic number, because the mean of its divisors is an integer number (849120781761).
Almost surely, 25660532350665 is an apocalyptic number.
It is an amenable number.
5660532350665 is a deficient number, since it is larger than the sum of its proper divisors (1132433903423).
5660532350665 is a wasteful number, since it uses less digits than its factorization.
5660532350665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54572219.
The product of its (nonzero) digits is 14580000, while the sum is 52.
The spelling of 5660532350665 in words is "five trillion, six hundred sixty billion, five hundred thirty-two million, three hundred fifty thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •