Base | Representation |
---|---|
bin | 11111100111000… |
… | …100010101010101 |
3 | 1100221220210221022 |
4 | 133213010111111 |
5 | 2041231210221 |
6 | 124342530525 |
7 | 16066526234 |
oct | 3747042525 |
9 | 1327823838 |
10 | 530335061 |
11 | 2523a6643 |
12 | 129736a45 |
13 | 85b46739 |
14 | 50610b1b |
15 | 3185b4ab |
hex | 1f9c4555 |
530335061 has 2 divisors, whose sum is σ = 530335062. Its totient is φ = 530335060.
The previous prime is 530334991. The next prime is 530335153. The reversal of 530335061 is 160533035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 330112561 + 200222500 = 18169^2 + 14150^2 .
It is a cyclic number.
It is not a de Polignac number, because 530335061 - 210 = 530334037 is a prime.
It is a super-3 number, since 3×5303350613 (a number of 27 digits) contains 333 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 530335061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530335661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265167530 + 265167531.
It is an arithmetic number, because the mean of its divisors is an integer number (265167531).
Almost surely, 2530335061 is an apocalyptic number.
It is an amenable number.
530335061 is a deficient number, since it is larger than the sum of its proper divisors (1).
530335061 is an equidigital number, since it uses as much as digits as its factorization.
530335061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4050, while the sum is 26.
The square root of 530335061 is about 23029.0047765855. The cubic root of 530335061 is about 809.4377345688.
Adding to 530335061 its reverse (160533035), we get a palindrome (690868096).
The spelling of 530335061 in words is "five hundred thirty million, three hundred thirty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •