Base | Representation |
---|---|
bin | 1001101100001010… |
… | …01110001100101001 |
3 | 111102120001111222211 |
4 | 10312011032030221 |
5 | 41123242241313 |
6 | 2220115245121 |
7 | 242626604254 |
oct | 46605161451 |
9 | 14376044884 |
10 | 5202305833 |
11 | 222a62540a |
12 | 10122a97a1 |
13 | 64ba4259a |
14 | 374cc409b |
15 | 206ab8e3d |
hex | 13614e329 |
5202305833 has 2 divisors, whose sum is σ = 5202305834. Its totient is φ = 5202305832.
The previous prime is 5202305803. The next prime is 5202305891. The reversal of 5202305833 is 3385032025.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5003157289 + 199148544 = 70733^2 + 14112^2 .
It is a cyclic number.
It is not a de Polignac number, because 5202305833 - 29 = 5202305321 is a prime.
It is a super-3 number, since 3×52023058333 (a number of 30 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5202305795 and 5202305804.
It is not a weakly prime, because it can be changed into another prime (5202305803) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2601152916 + 2601152917.
It is an arithmetic number, because the mean of its divisors is an integer number (2601152917).
Almost surely, 25202305833 is an apocalyptic number.
It is an amenable number.
5202305833 is a deficient number, since it is larger than the sum of its proper divisors (1).
5202305833 is an equidigital number, since it uses as much as digits as its factorization.
5202305833 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 31.
The square root of 5202305833 is about 72127.0118124964. The cubic root of 5202305833 is about 1732.7342501115.
Adding to 5202305833 its reverse (3385032025), we get a palindrome (8587337858).
The spelling of 5202305833 in words is "five billion, two hundred two million, three hundred five thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •