Base | Representation |
---|---|
bin | 1010100010010010… |
… | …01000010001011011 |
3 | 112121012100120110002 |
4 | 11101021020101123 |
5 | 43041004034341 |
6 | 2333134243215 |
7 | 260111612126 |
oct | 52111102133 |
9 | 15535316402 |
10 | 5656314971 |
11 | 244292a17a |
12 | 111a35650b |
13 | 6c1b14048 |
14 | 3b93073bd |
15 | 23189a29b |
hex | 15124845b |
5656314971 has 2 divisors, whose sum is σ = 5656314972. Its totient is φ = 5656314970.
The previous prime is 5656314967. The next prime is 5656314973. The reversal of 5656314971 is 1794136565.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5656314971 - 22 = 5656314967 is a prime.
It is a Sophie Germain prime.
Together with 5656314973, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5656314973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2828157485 + 2828157486.
It is an arithmetic number, because the mean of its divisors is an integer number (2828157486).
Almost surely, 25656314971 is an apocalyptic number.
5656314971 is a deficient number, since it is larger than the sum of its proper divisors (1).
5656314971 is an equidigital number, since it uses as much as digits as its factorization.
5656314971 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 680400, while the sum is 47.
The square root of 5656314971 is about 75208.4767230397. The cubic root of 5656314971 is about 1781.7408137876.
The spelling of 5656314971 in words is "five billion, six hundred fifty-six million, three hundred fourteen thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •