Base | Representation |
---|---|
bin | 1001100011001110… |
… | …0110100100001111 |
3 | 20121122222122001211 |
4 | 2120303212210033 |
5 | 20222244223033 |
6 | 1102220115251 |
7 | 120346533325 |
oct | 23063464417 |
9 | 6548878054 |
10 | 2563664143 |
11 | 10a61378a7 |
12 | 5b6695b27 |
13 | 31b190141 |
14 | 1a46a3d15 |
15 | 1001042cd |
hex | 98ce690f |
2563664143 has 2 divisors, whose sum is σ = 2563664144. Its totient is φ = 2563664142.
The previous prime is 2563664101. The next prime is 2563664183. The reversal of 2563664143 is 3414663652.
It is a happy number.
2563664143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (2563664183) can be obtained adding 2563664143 to its sum of digits (40).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2563664143 - 221 = 2561566991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2563664096 and 2563664105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2563664183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1281832071 + 1281832072.
It is an arithmetic number, because the mean of its divisors is an integer number (1281832072).
Almost surely, 22563664143 is an apocalyptic number.
2563664143 is a deficient number, since it is larger than the sum of its proper divisors (1).
2563664143 is an equidigital number, since it uses as much as digits as its factorization.
2563664143 is an evil number, because the sum of its binary digits is even.
The product of its digits is 311040, while the sum is 40.
The square root of 2563664143 is about 50632.6391075954. The cubic root of 2563664143 is about 1368.6331124915.
The spelling of 2563664143 in words is "two billion, five hundred sixty-three million, six hundred sixty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •