Base | Representation |
---|---|
bin | 110111001100110001001110… |
… | …011010111011110101000101 |
3 | 1011211120120220222220211201210 |
4 | 313030301032122323311011 |
5 | 223310021024030412012 |
6 | 2220155004153042033 |
7 | 102064362040414620 |
oct | 6714611632736505 |
9 | 1154516828824653 |
10 | 242770047122757 |
11 | 703992206649a0 |
12 | 2328a5656b6319 |
13 | a56016a690b6b |
14 | 43d41c0c54db7 |
15 | 1d1001565e23c |
hex | dccc4e6bbd45 |
242770047122757 has 64 divisors (see below), whose sum is σ = 428536385685504. Its totient is φ = 118353757808640.
The previous prime is 242770047122749. The next prime is 242770047122807. The reversal of 242770047122757 is 757221740077242.
It is a happy number.
It is not a de Polignac number, because 242770047122757 - 23 = 242770047122749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 242770047122697 and 242770047122706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242770047123757) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 87716208 + ... + 90441545.
It is an arithmetic number, because the mean of its divisors is an integer number (6695881026336).
Almost surely, 2242770047122757 is an apocalyptic number.
It is an amenable number.
242770047122757 is a deficient number, since it is larger than the sum of its proper divisors (185766338562747).
242770047122757 is a wasteful number, since it uses less digits than its factorization.
242770047122757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178158138.
The product of its (nonzero) digits is 21512960, while the sum is 57.
Adding to 242770047122757 its reverse (757221740077242), we get a palindrome (999991787199999).
The spelling of 242770047122757 in words is "two hundred forty-two trillion, seven hundred seventy billion, forty-seven million, one hundred twenty-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •