Base | Representation |
---|---|
bin | 1010101111111011… |
… | …00100100111011101 |
3 | 112220011122020200011 |
4 | 11113331210213131 |
5 | 43304301211403 |
6 | 2352342403221 |
7 | 263001234424 |
oct | 52775444735 |
9 | 15804566604 |
10 | 5770725853 |
11 | 24a1473822 |
12 | 1150730511 |
13 | 70c731ca9 |
14 | 3ca5aa2bb |
15 | 23b949a6d |
hex | 157f649dd |
5770725853 has 2 divisors, whose sum is σ = 5770725854. Its totient is φ = 5770725852.
The previous prime is 5770725839. The next prime is 5770725869. The reversal of 5770725853 is 3585270775.
5770725853 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., 4814555769 + 956170084 = 69387^2 + 30922^2 .
It is a cyclic number.
It is not a de Polignac number, because 5770725853 - 225 = 5737171421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5770725797 and 5770725806.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5770725823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2885362926 + 2885362927.
It is an arithmetic number, because the mean of its divisors is an integer number (2885362927).
Almost surely, 25770725853 is an apocalyptic number.
It is an amenable number.
5770725853 is a deficient number, since it is larger than the sum of its proper divisors (1).
5770725853 is an equidigital number, since it uses as much as digits as its factorization.
5770725853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2058000, while the sum is 49.
The square root of 5770725853 is about 75965.2937399705. The cubic root of 5770725853 is about 1793.6738681557.
The spelling of 5770725853 in words is "five billion, seven hundred seventy million, seven hundred twenty-five thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •