Base | Representation |
---|---|
bin | 1111011011100110110… |
… | …01001011100111100101 |
3 | 1212200120201202020122022 |
4 | 13231303121023213211 |
5 | 32141341020132222 |
6 | 1043324525312525 |
7 | 53210161533155 |
oct | 7556331134745 |
9 | 1780521666568 |
10 | 530216958437 |
11 | 194955717621 |
12 | 86914705745 |
13 | 3accb45703a |
14 | 1b93c3c6765 |
15 | dbd3816042 |
hex | 7b7364b9e5 |
530216958437 has 2 divisors, whose sum is σ = 530216958438. Its totient is φ = 530216958436.
The previous prime is 530216958389. The next prime is 530216958461. The reversal of 530216958437 is 734859612035.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 506565286756 + 23651671681 = 711734^2 + 153791^2 .
It is a cyclic number.
It is not a de Polignac number, because 530216958437 - 214 = 530216942053 is a prime.
It is a super-3 number, since 3×5302169584373 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530216958937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265108479218 + 265108479219.
It is an arithmetic number, because the mean of its divisors is an integer number (265108479219).
It is a 1-persistent number, because it is pandigital, but 2⋅530216958437 = 1060433916874 is not.
Almost surely, 2530216958437 is an apocalyptic number.
It is an amenable number.
530216958437 is a deficient number, since it is larger than the sum of its proper divisors (1).
530216958437 is an equidigital number, since it uses as much as digits as its factorization.
530216958437 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5443200, while the sum is 53.
The spelling of 530216958437 in words is "five hundred thirty billion, two hundred sixteen million, nine hundred fifty-eight thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •