Base | Representation |
---|---|
bin | 1001110011001111… |
… | …10010110010001001 |
3 | 111120200211001210102 |
4 | 10321213302302021 |
5 | 41233443401413 |
6 | 2230040255145 |
7 | 244250466626 |
oct | 47147626211 |
9 | 14520731712 |
10 | 5261700233 |
11 | 2260102299 |
12 | 102a1714b5 |
13 | 65b1399ba |
14 | 37cb4534d |
15 | 20bdec458 |
hex | 1399f2c89 |
5261700233 has 2 divisors, whose sum is σ = 5261700234. Its totient is φ = 5261700232.
The previous prime is 5261700217. The next prime is 5261700251. The reversal of 5261700233 is 3320071625.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3043949584 + 2217750649 = 55172^2 + 47093^2 .
It is a cyclic number.
It is not a de Polignac number, because 5261700233 - 24 = 5261700217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5261700196 and 5261700205.
It is not a weakly prime, because it can be changed into another prime (5261700263) 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, 2630850116 + 2630850117.
It is an arithmetic number, because the mean of its divisors is an integer number (2630850117).
Almost surely, 25261700233 is an apocalyptic number.
It is an amenable number.
5261700233 is a deficient number, since it is larger than the sum of its proper divisors (1).
5261700233 is an equidigital number, since it uses as much as digits as its factorization.
5261700233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 29.
The square root of 5261700233 is about 72537.5780750915. The cubic root of 5261700233 is about 1739.3034858137.
Adding to 5261700233 its reverse (3320071625), we get a palindrome (8581771858).
The spelling of 5261700233 in words is "five billion, two hundred sixty-one million, seven hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •