Base | Representation |
---|---|
bin | 1001110011000011… |
… | …11100001111111101 |
3 | 111120120221010102012 |
4 | 10321201330033331 |
5 | 41233100304031 |
6 | 2225543341005 |
7 | 244231450226 |
oct | 47141741775 |
9 | 14516833365 |
10 | 5260166141 |
11 | 225a25474a |
12 | 1029751765 |
13 | 65aa20659 |
14 | 37c86624d |
15 | 20bbe7b2b |
hex | 13987c3fd |
5260166141 has 2 divisors, whose sum is σ = 5260166142. Its totient is φ = 5260166140.
The previous prime is 5260166089. The next prime is 5260166143. The reversal of 5260166141 is 1416610625.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5252625625 + 7540516 = 72475^2 + 2746^2 .
It is a cyclic number.
It is not a de Polignac number, because 5260166141 - 26 = 5260166077 is a prime.
Together with 5260166143, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5260166098 and 5260166107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5260166143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2630083070 + 2630083071.
It is an arithmetic number, because the mean of its divisors is an integer number (2630083071).
Almost surely, 25260166141 is an apocalyptic number.
It is an amenable number.
5260166141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5260166141 is an equidigital number, since it uses as much as digits as its factorization.
5260166141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 5260166141 is about 72527.0028403215. The cubic root of 5260166141 is about 1739.1344333019.
Adding to 5260166141 its reverse (1416610625), we get a palindrome (6676776766).
The spelling of 5260166141 in words is "five billion, two hundred sixty million, one hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •