Base | Representation |
---|---|
bin | 1011101110100110… |
… | …11100001000101101 |
3 | 121020211001222111221 |
4 | 11313103130020231 |
5 | 100343404130411 |
6 | 2520444543341 |
7 | 312014544256 |
oct | 56723341055 |
9 | 17224058457 |
10 | 6296551981 |
11 | 274126a775 |
12 | 1278851b51 |
13 | 79465a305 |
14 | 43a365b2d |
15 | 26cbb5071 |
hex | 1774dc22d |
6296551981 has 2 divisors, whose sum is σ = 6296551982. Its totient is φ = 6296551980.
The previous prime is 6296551969. The next prime is 6296551993. The reversal of 6296551981 is 1891556926.
It is a balanced prime because it is at equal distance from previous prime (6296551969) and next prime (6296551993).
It can be written as a sum of positive squares in only one way, i.e., 3148332100 + 3148219881 = 56110^2 + 56109^2 .
It is a cyclic number.
It is not a de Polignac number, because 6296551981 - 217 = 6296420909 is a prime.
It is a super-2 number, since 2×62965519812 = 79293133698870048722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6296551901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3148275990 + 3148275991.
It is an arithmetic number, because the mean of its divisors is an integer number (3148275991).
Almost surely, 26296551981 is an apocalyptic number.
6296551981 is the 56110-th centered square number.
It is an amenable number.
6296551981 is a deficient number, since it is larger than the sum of its proper divisors (1).
6296551981 is an equidigital number, since it uses as much as digits as its factorization.
6296551981 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1166400, while the sum is 52.
The square root of 6296551981 is about 79350.8158811237. The cubic root of 6296551981 is about 1846.5777473110.
The spelling of 6296551981 in words is "six billion, two hundred ninety-six million, five hundred fifty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •