Base | Representation |
---|---|
bin | 11010001110011110… |
… | …011001100100111001 |
3 | 2200200112021012112122 |
4 | 122032132121210321 |
5 | 430132443400104 |
6 | 20534145251025 |
7 | 2014556135216 |
oct | 321636314471 |
9 | 80615235478 |
10 | 28160137529 |
11 | 10a40733137 |
12 | 555a933a75 |
13 | 286a158c94 |
14 | 1511d56b0d |
15 | aec3496be |
hex | 68e799939 |
28160137529 has 2 divisors, whose sum is σ = 28160137530. Its totient is φ = 28160137528.
The previous prime is 28160137487. The next prime is 28160137531. The reversal of 28160137529 is 92573106182.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28140733504 + 19404025 = 167752^2 + 4405^2 .
It is a cyclic number.
It is not a de Polignac number, because 28160137529 - 228 = 27891702073 is a prime.
It is a Sophie Germain prime.
Together with 28160137531, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 28160137529.
It is not a weakly prime, because it can be changed into another prime (28160137589) 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, 14080068764 + 14080068765.
It is an arithmetic number, because the mean of its divisors is an integer number (14080068765).
Almost surely, 228160137529 is an apocalyptic number.
It is an amenable number.
28160137529 is a deficient number, since it is larger than the sum of its proper divisors (1).
28160137529 is an equidigital number, since it uses as much as digits as its factorization.
28160137529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 44.
The spelling of 28160137529 in words is "twenty-eight billion, one hundred sixty million, one hundred thirty-seven thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •