Base | Representation |
---|---|
bin | 111100010010010101000111… |
… | …0110000101110101101110101 |
3 | 2120112120201211101002202112022 |
4 | 1320210222032300232231311 |
5 | 1024001141311242304434 |
6 | 5115453253034402525 |
7 | 216460546235613515 |
oct | 17044521660565565 |
9 | 2515521741082468 |
10 | 530284827306869 |
11 | 143a68594577208 |
12 | 4b584903890445 |
13 | 199b784c39c6bb |
14 | 94d3ccb80d845 |
15 | 4148dd2d0d22e |
hex | 1e24a8ec2eb75 |
530284827306869 has 2 divisors, whose sum is σ = 530284827306870. Its totient is φ = 530284827306868.
The previous prime is 530284827306853. The next prime is 530284827306877. The reversal of 530284827306869 is 968603728482035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 527876449215844 + 2408378091025 = 22975562^2 + 1551895^2 .
It is a cyclic number.
It is not a de Polignac number, because 530284827306869 - 24 = 530284827306853 is a prime.
It is a super-2 number, since 2×5302848273068692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530284827306769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265142413653434 + 265142413653435.
It is an arithmetic number, because the mean of its divisors is an integer number (265142413653435).
Almost surely, 2530284827306869 is an apocalyptic number.
It is an amenable number.
530284827306869 is a deficient number, since it is larger than the sum of its proper divisors (1).
530284827306869 is an equidigital number, since it uses as much as digits as its factorization.
530284827306869 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 836075520, while the sum is 71.
The spelling of 530284827306869 in words is "five hundred thirty trillion, two hundred eighty-four billion, eight hundred twenty-seven million, three hundred six thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •