Base | Representation |
---|---|
bin | 1010101001111100… |
… | …11001011101100101 |
3 | 112202200100010112221 |
4 | 11110332121131211 |
5 | 43203434020121 |
6 | 2343352312341 |
7 | 261522250123 |
oct | 52476313545 |
9 | 15680303487 |
10 | 5720610661 |
11 | 2476154507 |
12 | 11379a26b1 |
13 | 70223632c |
14 | 3c3a82913 |
15 | 23734ab41 |
hex | 154f99765 |
5720610661 has 2 divisors, whose sum is σ = 5720610662. Its totient is φ = 5720610660.
The previous prime is 5720610587. The next prime is 5720610671. The reversal of 5720610661 is 1660160275.
It is a happy number.
5720610661 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5720048161 + 562500 = 75631^2 + 750^2 .
It is a cyclic number.
It is not a de Polignac number, because 5720610661 - 29 = 5720610149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5720610671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2860305330 + 2860305331.
It is an arithmetic number, because the mean of its divisors is an integer number (2860305331).
Almost surely, 25720610661 is an apocalyptic number.
It is an amenable number.
5720610661 is a deficient number, since it is larger than the sum of its proper divisors (1).
5720610661 is an equidigital number, since it uses as much as digits as its factorization.
5720610661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 5720610661 is about 75634.7186218075. The cubic root of 5720610661 is about 1788.4664477320.
The spelling of 5720610661 in words is "five billion, seven hundred twenty million, six hundred ten thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •