Base | Representation |
---|---|
bin | 111011100000101101101100… |
… | …0111101101110110011101101 |
3 | 2112122102211101011120220021012 |
4 | 1313001123120331232303231 |
5 | 1022102430140011204203 |
6 | 5053152450054315005 |
7 | 215155101100352333 |
oct | 16701333075566355 |
9 | 2478384334526235 |
10 | 523465664163053 |
11 | 1418795a5775527 |
12 | 4a86319b958a65 |
13 | 196117a5ba40b1 |
14 | 9339c325b3b53 |
15 | 407b82351ebd8 |
hex | 1dc16d8f6eced |
523465664163053 has 2 divisors, whose sum is σ = 523465664163054. Its totient is φ = 523465664163052.
The previous prime is 523465664162981. The next prime is 523465664163119. The reversal of 523465664163053 is 350361466564325.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 520789734189124 + 2675929973929 = 22820818^2 + 1635827^2 .
It is a cyclic number.
It is not a de Polignac number, because 523465664163053 - 234 = 523448484293869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 523465664162983 and 523465664163001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (523465664162053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 261732832081526 + 261732832081527.
It is an arithmetic number, because the mean of its divisors is an integer number (261732832081527).
Almost surely, 2523465664163053 is an apocalyptic number.
It is an amenable number.
523465664163053 is a deficient number, since it is larger than the sum of its proper divisors (1).
523465664163053 is an equidigital number, since it uses as much as digits as its factorization.
523465664163053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 139968000, while the sum is 59.
The spelling of 523465664163053 in words is "five hundred twenty-three trillion, four hundred sixty-five billion, six hundred sixty-four million, one hundred sixty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •