Base | Representation |
---|---|
bin | 100111001101000… |
… | …101100110100010 |
3 | 1200211122202201210 |
4 | 213031011212202 |
5 | 2321340222432 |
6 | 145133410550 |
7 | 22204500603 |
oct | 4715054642 |
9 | 1624582653 |
10 | 657742242 |
11 | 308307533 |
12 | 164339a56 |
13 | a6364cc1 |
14 | 634d7daa |
15 | 3cb268cc |
hex | 273459a2 |
657742242 has 8 divisors (see below), whose sum is σ = 1315484496. Its totient is φ = 219247412.
The previous prime is 657742177. The next prime is 657742249. The reversal of 657742242 is 242247756.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
657742242 is an admirable number.
It is a super-2 number, since 2×6577422422 = 865249713822373128, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 657742242.
It is not an unprimeable number, because it can be changed into a prime (657742249) 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, 54811848 + ... + 54811859.
It is an arithmetic number, because the mean of its divisors is an integer number (164435562).
Almost surely, 2657742242 is an apocalyptic number.
657742242 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
657742242 is a wasteful number, since it uses less digits than its factorization.
657742242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109623712.
The product of its digits is 188160, while the sum is 39.
The square root of 657742242 is about 25646.4859581191. The cubic root of 657742242 is about 869.6648385291.
Adding to 657742242 its reverse (242247756), we get a palindrome (899989998).
The spelling of 657742242 in words is "six hundred fifty-seven million, seven hundred forty-two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •