Base | Representation |
---|---|
bin | 111011111110111000110111… |
… | …101111010010000000101011 |
3 | 1021121001122110202000022000221 |
4 | 323332320313233102000223 |
5 | 234034201020044140311 |
6 | 2333022554501310511 |
7 | 106365245632062244 |
oct | 7376706757220053 |
9 | 1247048422008027 |
10 | 263806416396331 |
11 | 77069744700406 |
12 | 2570754b105437 |
13 | b427ab8a45043 |
14 | 4920427819ccb |
15 | 2077324b12671 |
hex | efee37bd202b |
263806416396331 has 2 divisors, whose sum is σ = 263806416396332. Its totient is φ = 263806416396330.
The previous prime is 263806416396323. The next prime is 263806416396349. The reversal of 263806416396331 is 133693614608362.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 263806416396331 - 23 = 263806416396323 is a prime.
It is a super-2 number, since 2×2638064163963312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 263806416396331.
It is not a weakly prime, because it can be changed into another prime (263806416396301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 131903208198165 + 131903208198166.
It is an arithmetic number, because the mean of its divisors is an integer number (131903208198166).
Almost surely, 2263806416396331 is an apocalyptic number.
263806416396331 is a deficient number, since it is larger than the sum of its proper divisors (1).
263806416396331 is an equidigital number, since it uses as much as digits as its factorization.
263806416396331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60466176, while the sum is 61.
The spelling of 263806416396331 in words is "two hundred sixty-three trillion, eight hundred six billion, four hundred sixteen million, three hundred ninety-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •