Base | Representation |
---|---|
bin | 100111011001101… |
… | …101011100010101 |
3 | 1201001212212201012 |
4 | 213121231130111 |
5 | 2323212114112 |
6 | 145332342005 |
7 | 22244561564 |
oct | 4731553425 |
9 | 1631785635 |
10 | 661051157 |
11 | 30a167578 |
12 | 165474905 |
13 | a6c53140 |
14 | 63b19bdb |
15 | 3d07c022 |
hex | 2766d715 |
661051157 has 4 divisors (see below), whose sum is σ = 711901260. Its totient is φ = 610201056.
The previous prime is 661051147. The next prime is 661051177. The reversal of 661051157 is 751150166.
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 385690321 + 275360836 = 19639^2 + 16594^2 .
It is a cyclic number.
It is not a de Polignac number, because 661051157 - 212 = 661047061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (661051147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25425032 + ... + 25425057.
It is an arithmetic number, because the mean of its divisors is an integer number (177975315).
Almost surely, 2661051157 is an apocalyptic number.
It is an amenable number.
661051157 is a deficient number, since it is larger than the sum of its proper divisors (50850103).
661051157 is a wasteful number, since it uses less digits than its factorization.
661051157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50850102.
The product of its (nonzero) digits is 6300, while the sum is 32.
The square root of 661051157 is about 25710.9151334603. The cubic root of 661051157 is about 871.1207456939.
Subtracting 661051157 from its reverse (751150166), we obtain a palindrome (90099009).
The spelling of 661051157 in words is "six hundred sixty-one million, fifty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •