Base | Representation |
---|---|
bin | 1001100110001100… |
… | …01101111011100001 |
3 | 111022001211200001011 |
4 | 10303012031323201 |
5 | 41022433011413 |
6 | 2211130140521 |
7 | 241451163655 |
oct | 46306157341 |
9 | 14261750034 |
10 | 5152235233 |
11 | 2204336652 |
12 | bb9581741 |
13 | 641561002 |
14 | 36c3aca65 |
15 | 2024c833d |
hex | 13318dee1 |
5152235233 has 2 divisors, whose sum is σ = 5152235234. Its totient is φ = 5152235232.
The previous prime is 5152235201. The next prime is 5152235251. The reversal of 5152235233 is 3325322515.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4985489664 + 166745569 = 70608^2 + 12913^2 .
It is a cyclic number.
It is not a de Polignac number, because 5152235233 - 25 = 5152235201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5152235195 and 5152235204.
It is not a weakly prime, because it can be changed into another prime (5152235293) 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, 2576117616 + 2576117617.
It is an arithmetic number, because the mean of its divisors is an integer number (2576117617).
Almost surely, 25152235233 is an apocalyptic number.
It is an amenable number.
5152235233 is a deficient number, since it is larger than the sum of its proper divisors (1).
5152235233 is an equidigital number, since it uses as much as digits as its factorization.
5152235233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27000, while the sum is 31.
The square root of 5152235233 is about 71779.0723888237. The cubic root of 5152235233 is about 1727.1573074158.
Adding to 5152235233 its reverse (3325322515), we get a palindrome (8477557748).
The spelling of 5152235233 in words is "five billion, one hundred fifty-two million, two hundred thirty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •