Base | Representation |
---|---|
bin | 111001011100110101100001… |
… | …0011111110111001110101101 |
3 | 2110021021002020002000120021001 |
4 | 1302321223002133313032231 |
5 | 1012213444343430322412 |
6 | 4550434122112040301 |
7 | 211304435206513654 |
oct | 16271530237671655 |
9 | 2407232202016231 |
10 | 505340525245357 |
11 | 13702079333423a |
12 | 48816467533091 |
13 | 188c853a3bcc79 |
14 | 8cb087d19a19b |
15 | 3d65100468957 |
hex | 1cb9ac27f73ad |
505340525245357 has 2 divisors, whose sum is σ = 505340525245358. Its totient is φ = 505340525245356.
The previous prime is 505340525245343. The next prime is 505340525245469. The reversal of 505340525245357 is 753542525043505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 321284796487561 + 184055728757796 = 17924419^2 + 13566714^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-505340525245357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 505340525245298 and 505340525245307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (505340525245327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252670262622678 + 252670262622679.
It is an arithmetic number, because the mean of its divisors is an integer number (252670262622679).
Almost surely, 2505340525245357 is an apocalyptic number.
It is an amenable number.
505340525245357 is a deficient number, since it is larger than the sum of its proper divisors (1).
505340525245357 is an equidigital number, since it uses as much as digits as its factorization.
505340525245357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 63000000, while the sum is 55.
The spelling of 505340525245357 in words is "five hundred five trillion, three hundred forty billion, five hundred twenty-five million, two hundred forty-five thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •