Base | Representation |
---|---|
bin | 1001101100001100… |
… | …00000101011111001 |
3 | 111102120110000200002 |
4 | 10312012000223321 |
5 | 41123320401013 |
6 | 2220123522345 |
7 | 242631425213 |
oct | 46606005371 |
9 | 14376400602 |
10 | 5202512633 |
11 | 222a75681a |
12 | 10123893b5 |
13 | 64bab5756 |
14 | 374d395b3 |
15 | 206b0a358 |
hex | 136180af9 |
5202512633 has 2 divisors, whose sum is σ = 5202512634. Its totient is φ = 5202512632.
The previous prime is 5202512629. The next prime is 5202512639. The reversal of 5202512633 is 3362152025.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4015503424 + 1187009209 = 63368^2 + 34453^2 .
It is a cyclic number.
It is not a de Polignac number, because 5202512633 - 22 = 5202512629 is a prime.
It is a super-2 number, since 2×52025126332 = 54132275393049185378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5202512596 and 5202512605.
It is not a weakly prime, because it can be changed into another prime (5202512639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2601256316 + 2601256317.
It is an arithmetic number, because the mean of its divisors is an integer number (2601256317).
Almost surely, 25202512633 is an apocalyptic number.
It is an amenable number.
5202512633 is a deficient number, since it is larger than the sum of its proper divisors (1).
5202512633 is an equidigital number, since it uses as much as digits as its factorization.
5202512633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 5202512633 is about 72128.4453804461. The cubic root of 5202512633 is about 1732.7572094624.
Adding to 5202512633 its reverse (3362152025), we get a palindrome (8564664658).
The spelling of 5202512633 in words is "five billion, two hundred two million, five hundred twelve thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •