Base | Representation |
---|---|
bin | 100110010010000010100… |
… | …0110101110010100011101 |
3 | 200121222122110001212200002 |
4 | 1030210011012232110131 |
5 | 1142200342132230034 |
6 | 15105021354544045 |
7 | 1052060623036601 |
oct | 114440506562435 |
9 | 20558573055602 |
10 | 5261420586269 |
11 | 17493a0835261 |
12 | 70b847138025 |
13 | 2c21c42492c3 |
14 | 142922c6b501 |
15 | 91cdcea7e7e |
hex | 4c9051ae51d |
5261420586269 has 2 divisors, whose sum is σ = 5261420586270. Its totient is φ = 5261420586268.
The previous prime is 5261420586199. The next prime is 5261420586277. The reversal of 5261420586269 is 9626850241625.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5176252919044 + 85167667225 = 2275138^2 + 291835^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5261420586269 is a prime.
It is a super-2 number, since 2×52614205862692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5261420546269) 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, 2630710293134 + 2630710293135.
It is an arithmetic number, because the mean of its divisors is an integer number (2630710293135).
Almost surely, 25261420586269 is an apocalyptic number.
It is an amenable number.
5261420586269 is a deficient number, since it is larger than the sum of its proper divisors (1).
5261420586269 is an equidigital number, since it uses as much as digits as its factorization.
5261420586269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12441600, while the sum is 56.
The spelling of 5261420586269 in words is "five trillion, two hundred sixty-one billion, four hundred twenty million, five hundred eighty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •