Base | Representation |
---|---|
bin | 1111011100001100001… |
… | …00010011101100000001 |
3 | 1212201101120021021202201 |
4 | 13232012010103230001 |
5 | 32143011221103234 |
6 | 1043420000313201 |
7 | 53221014515101 |
oct | 7560604235401 |
9 | 1781346237681 |
10 | 530530253569 |
11 | 194aa6551918 |
12 | 869a1612801 |
13 | 3b04b32b484 |
14 | 1b96bc5b201 |
15 | dc0109e314 |
hex | 7b86113b01 |
530530253569 has 2 divisors, whose sum is σ = 530530253570. Its totient is φ = 530530253568.
The previous prime is 530530253489. The next prime is 530530253593. The reversal of 530530253569 is 965352035035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 472683750400 + 57846503169 = 687520^2 + 240513^2 .
It is a cyclic number.
It is not a de Polignac number, because 530530253569 - 27 = 530530253441 is a prime.
It is a super-2 number, since 2×5305302535692 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (530530253069) 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, 265265126784 + 265265126785.
It is an arithmetic number, because the mean of its divisors is an integer number (265265126785).
Almost surely, 2530530253569 is an apocalyptic number.
It is an amenable number.
530530253569 is a deficient number, since it is larger than the sum of its proper divisors (1).
530530253569 is an equidigital number, since it uses as much as digits as its factorization.
530530253569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1822500, while the sum is 46.
The spelling of 530530253569 in words is "five hundred thirty billion, five hundred thirty million, two hundred fifty-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •