Base | Representation |
---|---|
bin | 1010100110011111… |
… | …11100010001011101 |
3 | 112200122212001012201 |
4 | 11103033330101131 |
5 | 43124030432021 |
6 | 2340435531501 |
7 | 261021162055 |
oct | 52317742135 |
9 | 15618761181 |
10 | 5691655261 |
11 | 2460877926 |
12 | 112a159b91 |
13 | 6c9238966 |
14 | 3bdca6565 |
15 | 234a2b591 |
hex | 1533fc45d |
5691655261 has 2 divisors, whose sum is σ = 5691655262. Its totient is φ = 5691655260.
The previous prime is 5691655259. The next prime is 5691655271. The reversal of 5691655261 is 1625561965.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3953265625 + 1738389636 = 62875^2 + 41694^2 .
It is a cyclic number.
It is not a de Polignac number, because 5691655261 - 21 = 5691655259 is a prime.
It is a super-2 number, since 2×56916552612 = 64789879220137956242, which contains 22 as substring.
Together with 5691655259, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5691655271) 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, 2845827630 + 2845827631.
It is an arithmetic number, because the mean of its divisors is an integer number (2845827631).
Almost surely, 25691655261 is an apocalyptic number.
It is an amenable number.
5691655261 is a deficient number, since it is larger than the sum of its proper divisors (1).
5691655261 is an equidigital number, since it uses as much as digits as its factorization.
5691655261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 486000, while the sum is 46.
The square root of 5691655261 is about 75443.0597271876. The cubic root of 5691655261 is about 1785.4438461378.
The spelling of 5691655261 in words is "five billion, six hundred ninety-one million, six hundred fifty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •