Base | Representation |
---|---|
bin | 1001011000111100… |
… | …00111000110111001 |
3 | 111000022122021212111 |
4 | 10230132013012321 |
5 | 40311002330413 |
6 | 2152115212321 |
7 | 235631200531 |
oct | 45436070671 |
9 | 14008567774 |
10 | 5041058233 |
11 | 2157600732 |
12 | b882a70a1 |
13 | 624505cc3 |
14 | 35b70c4c1 |
15 | 1e7866d3d |
hex | 12c7871b9 |
5041058233 has 2 divisors, whose sum is σ = 5041058234. Its totient is φ = 5041058232.
The previous prime is 5041058227. The next prime is 5041058251. The reversal of 5041058233 is 3328501405.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3144629929 + 1896428304 = 56077^2 + 43548^2 .
It is a cyclic number.
It is not a de Polignac number, because 5041058233 - 213 = 5041050041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5041058195 and 5041058204.
It is not a weakly prime, because it can be changed into another prime (5041058293) 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, 2520529116 + 2520529117.
It is an arithmetic number, because the mean of its divisors is an integer number (2520529117).
Almost surely, 25041058233 is an apocalyptic number.
It is an amenable number.
5041058233 is a deficient number, since it is larger than the sum of its proper divisors (1).
5041058233 is an equidigital number, since it uses as much as digits as its factorization.
5041058233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 5041058233 is about 71000.4100903650. The cubic root of 5041058233 is about 1714.6437657926.
Adding to 5041058233 its reverse (3328501405), we get a palindrome (8369559638).
The spelling of 5041058233 in words is "five billion, forty-one million, fifty-eight thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •