Base | Representation |
---|---|
bin | 1010100110000010… |
… | …00110010100011101 |
3 | 112200101112100202022 |
4 | 11103001012110131 |
5 | 43122031424003 |
6 | 2340220305525 |
7 | 260643125033 |
oct | 52301062435 |
9 | 15611470668 |
10 | 5687764253 |
11 | 245965a516 |
12 | 11289a22a5 |
13 | 6c84a58a2 |
14 | 3bd572553 |
15 | 23450d738 |
hex | 15304651d |
5687764253 has 2 divisors, whose sum is σ = 5687764254. Its totient is φ = 5687764252.
The previous prime is 5687764223. The next prime is 5687764289. The reversal of 5687764253 is 3524677865.
It is a happy number.
5687764253 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., 4457298169 + 1230466084 = 66763^2 + 35078^2 .
It is a cyclic number.
It is not a de Polignac number, because 5687764253 - 26 = 5687764189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5687764195 and 5687764204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5687764223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2843882126 + 2843882127.
It is an arithmetic number, because the mean of its divisors is an integer number (2843882127).
Almost surely, 25687764253 is an apocalyptic number.
It is an amenable number.
5687764253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5687764253 is an equidigital number, since it uses as much as digits as its factorization.
5687764253 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8467200, while the sum is 53.
The square root of 5687764253 is about 75417.2676049723. The cubic root of 5687764253 is about 1785.0368901247.
The spelling of 5687764253 in words is "five billion, six hundred eighty-seven million, seven hundred sixty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •