Base | Representation |
---|---|
bin | 1001111011100000… |
… | …10100101101110001 |
3 | 111202112022011020202 |
4 | 10331300110231301 |
5 | 41404221421413 |
6 | 2240554444545 |
7 | 246052064633 |
oct | 47560245561 |
9 | 14675264222 |
10 | 5331045233 |
11 | 2296266208 |
12 | 1049433755 |
13 | 66c609347 |
14 | 388036a53 |
15 | 213048e58 |
hex | 13dc14b71 |
5331045233 has 2 divisors, whose sum is σ = 5331045234. Its totient is φ = 5331045232.
The previous prime is 5331045221. The next prime is 5331045253. The reversal of 5331045233 is 3325401335.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2945015824 + 2386029409 = 54268^2 + 48847^2 .
It is a cyclic number.
It is not a de Polignac number, because 5331045233 - 24 = 5331045217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5331045196 and 5331045205.
It is not a weakly prime, because it can be changed into another prime (5331045253) 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, 2665522616 + 2665522617.
It is an arithmetic number, because the mean of its divisors is an integer number (2665522617).
Almost surely, 25331045233 is an apocalyptic number.
It is an amenable number.
5331045233 is a deficient number, since it is larger than the sum of its proper divisors (1).
5331045233 is an equidigital number, since it uses as much as digits as its factorization.
5331045233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 29.
The square root of 5331045233 is about 73014.0071013775. The cubic root of 5331045233 is about 1746.9110387642.
Adding to 5331045233 its reverse (3325401335), we get a palindrome (8656446568).
The spelling of 5331045233 in words is "five billion, three hundred thirty-one million, forty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •