Base | Representation |
---|---|
bin | 1001101011111010… |
… | …00000001111101101 |
3 | 111102102000001211221 |
4 | 10311331000033231 |
5 | 41122214322113 |
6 | 2220001143341 |
7 | 242602362433 |
oct | 46575001755 |
9 | 14372001757 |
10 | 5200151533 |
11 | 22293938a5 |
12 | 101162ab51 |
13 | 64b469b55 |
14 | 3748c2d53 |
15 | 2067e098d |
hex | 135f403ed |
5200151533 has 2 divisors, whose sum is σ = 5200151534. Its totient is φ = 5200151532.
The previous prime is 5200151531. The next prime is 5200151587. The reversal of 5200151533 is 3351510025.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5154952804 + 45198729 = 71798^2 + 6723^2 .
It is a cyclic number.
It is not a de Polignac number, because 5200151533 - 21 = 5200151531 is a prime.
Together with 5200151531, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5200151498 and 5200151507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5200151531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2600075766 + 2600075767.
It is an arithmetic number, because the mean of its divisors is an integer number (2600075767).
Almost surely, 25200151533 is an apocalyptic number.
It is an amenable number.
5200151533 is a deficient number, since it is larger than the sum of its proper divisors (1).
5200151533 is an equidigital number, since it uses as much as digits as its factorization.
5200151533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2250, while the sum is 25.
The square root of 5200151533 is about 72112.0761939358. The cubic root of 5200151533 is about 1732.4950392120.
Adding to 5200151533 its reverse (3351510025), we get a palindrome (8551661558).
The spelling of 5200151533 in words is "five billion, two hundred million, one hundred fifty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •