Base | Representation |
---|---|
bin | 111011110100110011010101… |
… | …010011001011010011100101 |
3 | 1021111121101100112102112000022 |
4 | 323310303111103023103211 |
5 | 233441321441413031023 |
6 | 2331332323034324525 |
7 | 106264210144360133 |
oct | 7364632523132345 |
9 | 1244541315375008 |
10 | 263113275127013 |
11 | 76921793507683 |
12 | 25615147589745 |
13 | b3a762454b02c |
14 | 48d8a713ba753 |
15 | 20642a7c6b7c8 |
hex | ef4cd54cb4e5 |
263113275127013 has 2 divisors, whose sum is σ = 263113275127014. Its totient is φ = 263113275127012.
The previous prime is 263113275126983. The next prime is 263113275127033. The reversal of 263113275127013 is 310721572311362.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 161255889603649 + 101857385523364 = 12698657^2 + 10092442^2 .
It is a cyclic number.
It is not a de Polignac number, because 263113275127013 - 232 = 263108980159717 is a prime.
It is a super-2 number, since 2×2631132751270132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (263113275127033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 131556637563506 + 131556637563507.
It is an arithmetic number, because the mean of its divisors is an integer number (131556637563507).
Almost surely, 2263113275127013 is an apocalyptic number.
It is an amenable number.
263113275127013 is a deficient number, since it is larger than the sum of its proper divisors (1).
263113275127013 is an equidigital number, since it uses as much as digits as its factorization.
263113275127013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 317520, while the sum is 44.
The spelling of 263113275127013 in words is "two hundred sixty-three trillion, one hundred thirteen billion, two hundred seventy-five million, one hundred twenty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •