Base | Representation |
---|---|
bin | 11110101010101000101… |
… | …01010001100110000101 |
3 | 10201201201220021222211202 |
4 | 33111110111101212011 |
5 | 114230420023211012 |
6 | 2124015454512245 |
7 | 136061134645364 |
oct | 17252425214605 |
9 | 3651656258752 |
10 | 1053681850757 |
11 | 376955a31a08 |
12 | 150263b05685 |
13 | 78491a76283 |
14 | 38dd9b517db |
15 | 1c61e489cc2 |
hex | f554551985 |
1053681850757 has 2 divisors, whose sum is σ = 1053681850758. Its totient is φ = 1053681850756.
The previous prime is 1053681850723. The next prime is 1053681850787. The reversal of 1053681850757 is 7570581863501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1014318893956 + 39362956801 = 1007134^2 + 198401^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053681850757 - 234 = 1036501981573 is a prime.
It is a super-2 number, since 2×10536818507572 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053681850787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526840925378 + 526840925379.
It is an arithmetic number, because the mean of its divisors is an integer number (526840925379).
Almost surely, 21053681850757 is an apocalyptic number.
It is an amenable number.
1053681850757 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053681850757 is an equidigital number, since it uses as much as digits as its factorization.
1053681850757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056000, while the sum is 56.
The spelling of 1053681850757 in words is "one trillion, fifty-three billion, six hundred eighty-one million, eight hundred fifty thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •