Base | Representation |
---|---|
bin | 1001100000101000… |
… | …1110001000001001 |
3 | 20120220120111101211 |
4 | 2120022032020021 |
5 | 20212010104022 |
6 | 1101151413121 |
7 | 120155402434 |
oct | 23012161011 |
9 | 6526514354 |
10 | 2552816137 |
11 | 109aaa8603 |
12 | 5b2b241a1 |
13 | 318b625c1 |
14 | 1a307c81b |
15 | ee1aee77 |
hex | 9828e209 |
2552816137 has 2 divisors, whose sum is σ = 2552816138. Its totient is φ = 2552816136.
The previous prime is 2552816129. The next prime is 2552816141. The reversal of 2552816137 is 7316182552.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2092971001 + 459845136 = 45749^2 + 21444^2 .
It is a cyclic number.
It is not a de Polignac number, because 2552816137 - 23 = 2552816129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2552816137.
It is not a weakly prime, because it can be changed into another prime (2552816537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1276408068 + 1276408069.
It is an arithmetic number, because the mean of its divisors is an integer number (1276408069).
Almost surely, 22552816137 is an apocalyptic number.
It is an amenable number.
2552816137 is a deficient number, since it is larger than the sum of its proper divisors (1).
2552816137 is an equidigital number, since it uses as much as digits as its factorization.
2552816137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 100800, while the sum is 40.
The square root of 2552816137 is about 50525.4009088498. The cubic root of 2552816137 is about 1366.6999509311.
Adding to 2552816137 its reverse (7316182552), we get a palindrome (9868998689).
The spelling of 2552816137 in words is "two billion, five hundred fifty-two million, eight hundred sixteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •