Base | Representation |
---|---|
bin | 100110010001100111100… |
… | …0101010000111110010001 |
3 | 200121220022021121102110001 |
4 | 1030203033011100332101 |
5 | 1142142013120444012 |
6 | 15104351420410001 |
7 | 1052026306134112 |
oct | 114431705207621 |
9 | 20556267542401 |
10 | 5260514234257 |
11 | 1748a76164607 |
12 | 70b6336a6901 |
13 | 2c20ab53a639 |
14 | 14287873a209 |
15 | 91c88624357 |
hex | 4c8cf150f91 |
5260514234257 has 2 divisors, whose sum is σ = 5260514234258. Its totient is φ = 5260514234256.
The previous prime is 5260514234219. The next prime is 5260514234317. The reversal of 5260514234257 is 7524324150625.
5260514234257 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4745060595856 + 515453638401 = 2178316^2 + 717951^2 .
It is a cyclic number.
It is not a de Polignac number, because 5260514234257 - 239 = 4710758420369 is a prime.
It is a super-2 number, since 2×52605142342572 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5260514234557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2630257117128 + 2630257117129.
It is an arithmetic number, because the mean of its divisors is an integer number (2630257117129).
Almost surely, 25260514234257 is an apocalyptic number.
It is an amenable number.
5260514234257 is a deficient number, since it is larger than the sum of its proper divisors (1).
5260514234257 is an equidigital number, since it uses as much as digits as its factorization.
5260514234257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016000, while the sum is 46.
The spelling of 5260514234257 in words is "five trillion, two hundred sixty billion, five hundred fourteen million, two hundred thirty-four thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •