Base | Representation |
---|---|
bin | 111100000111000000011100… |
… | …100100110110100011001101 |
3 | 1021200000222111001112012221122 |
4 | 330013000130210312203031 |
5 | 234122321044421113221 |
6 | 2334131141421010325 |
7 | 106453455650065532 |
oct | 7407003444664315 |
9 | 1250028431465848 |
10 | 264364306426061 |
11 | 77264300017a86 |
12 | 257976a73b39a5 |
13 | b4685a7450c7a |
14 | 493d42d1acd89 |
15 | 2086ac7b11eab |
hex | f0701c9368cd |
264364306426061 has 2 divisors, whose sum is σ = 264364306426062. Its totient is φ = 264364306426060.
The previous prime is 264364306425827. The next prime is 264364306426091. The reversal of 264364306426061 is 160624603463462.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 167423051910436 + 96941254515625 = 12939206^2 + 9845875^2 .
It is a cyclic number.
It is not a de Polignac number, because 264364306426061 - 214 = 264364306409677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 264364306425994 and 264364306426012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (264364306426091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 132182153213030 + 132182153213031.
It is an arithmetic number, because the mean of its divisors is an integer number (132182153213031).
Almost surely, 2264364306426061 is an apocalyptic number.
It is an amenable number.
264364306426061 is a deficient number, since it is larger than the sum of its proper divisors (1).
264364306426061 is an equidigital number, since it uses as much as digits as its factorization.
264364306426061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17915904, while the sum is 53.
The spelling of 264364306426061 in words is "two hundred sixty-four trillion, three hundred sixty-four billion, three hundred six million, four hundred twenty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •