Base | Representation |
---|---|
bin | 1001100110001011… |
… | …00001011111110001 |
3 | 111022001111102101102 |
4 | 10303011201133301 |
5 | 41022411200413 |
6 | 2211122214145 |
7 | 241446505235 |
oct | 46305413761 |
9 | 14261442342 |
10 | 5152053233 |
11 | 2204221938 |
12 | bb94b4355 |
13 | 6414c9212 |
14 | 36c3625c5 |
15 | 20248e458 |
hex | 1331617f1 |
5152053233 has 2 divisors, whose sum is σ = 5152053234. Its totient is φ = 5152053232.
The previous prime is 5152053227. The next prime is 5152053253. The reversal of 5152053233 is 3323502515.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3047812849 + 2104240384 = 55207^2 + 45872^2 .
It is a cyclic number.
It is not a de Polignac number, because 5152053233 - 24 = 5152053217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5152053196 and 5152053205.
It is not a weakly prime, because it can be changed into another prime (5152053223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2576026616 + 2576026617.
It is an arithmetic number, because the mean of its divisors is an integer number (2576026617).
Almost surely, 25152053233 is an apocalyptic number.
It is an amenable number.
5152053233 is a deficient number, since it is larger than the sum of its proper divisors (1).
5152053233 is an equidigital number, since it uses as much as digits as its factorization.
5152053233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 29.
The square root of 5152053233 is about 71777.8045986362. The cubic root of 5152053233 is about 1727.1369702019.
Adding to 5152053233 its reverse (3323502515), we get a palindrome (8475555748).
The spelling of 5152053233 in words is "five billion, one hundred fifty-two million, fifty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •