Base | Representation |
---|---|
bin | 1010100100100111… |
… | …00101111100011001 |
3 | 112122120002022010002 |
4 | 11102103211330121 |
5 | 43111003211121 |
6 | 2335112502345 |
7 | 260436542243 |
oct | 52223457431 |
9 | 15576068102 |
10 | 5675835161 |
11 | 2452951a67 |
12 | 11249aa9b5 |
13 | 6c5b89c59 |
14 | 3bbb49093 |
15 | 233453e0b |
hex | 1524e5f19 |
5675835161 has 2 divisors, whose sum is σ = 5675835162. Its totient is φ = 5675835160.
The previous prime is 5675835149. The next prime is 5675835163. The reversal of 5675835161 is 1615385765.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3143732761 + 2532102400 = 56069^2 + 50320^2 .
It is a cyclic number.
It is not a de Polignac number, because 5675835161 - 210 = 5675834137 is a prime.
Together with 5675835163, 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 (5675835163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2837917580 + 2837917581.
It is an arithmetic number, because the mean of its divisors is an integer number (2837917581).
Almost surely, 25675835161 is an apocalyptic number.
It is an amenable number.
5675835161 is a deficient number, since it is larger than the sum of its proper divisors (1).
5675835161 is an equidigital number, since it uses as much as digits as its factorization.
5675835161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 756000, while the sum is 47.
The square root of 5675835161 is about 75338.1388209186. The cubic root of 5675835161 is about 1783.7880823078.
It can be divided in two parts, 56758 and 35161, that added together give a palindrome (91919).
The spelling of 5675835161 in words is "five billion, six hundred seventy-five million, eight hundred thirty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •