Base | Representation |
---|---|
bin | 111011110111101110111001… |
… | …001001111101110101010101 |
3 | 1021112022122011211122212122001 |
4 | 323313232321021331311111 |
5 | 234003121414100212042 |
6 | 2332005030544435301 |
7 | 106314566621145514 |
oct | 7367567111756525 |
9 | 1245278154585561 |
10 | 263314666413397 |
11 | 7699a139655935 |
12 | 25648191018b31 |
13 | b3c060ab87791 |
14 | 49046d818267b |
15 | 2069643413bb7 |
hex | ef7bb927dd55 |
263314666413397 has 2 divisors, whose sum is σ = 263314666413398. Its totient is φ = 263314666413396.
The previous prime is 263314666413349. The next prime is 263314666413427. The reversal of 263314666413397 is 793314666413362.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136081883791396 + 127232782622001 = 11665414^2 + 11279751^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-263314666413397 is a prime.
It is a super-2 number, since 2×2633146664133972 (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 (263314666413497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 131657333206698 + 131657333206699.
It is an arithmetic number, because the mean of its divisors is an integer number (131657333206699).
Almost surely, 2263314666413397 is an apocalyptic number.
It is an amenable number.
263314666413397 is a deficient number, since it is larger than the sum of its proper divisors (1).
263314666413397 is an equidigital number, since it uses as much as digits as its factorization.
263314666413397 is an evil number, because the sum of its binary digits is even.
The product of its digits is 211631616, while the sum is 64.
The spelling of 263314666413397 in words is "two hundred sixty-three trillion, three hundred fourteen billion, six hundred sixty-six million, four hundred thirteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •