Base | Representation |
---|---|
bin | 1111011011110100011… |
… | …01001000011111110001 |
3 | 1212200212200210101001211 |
4 | 13231322031020133301 |
5 | 32142104244143213 |
6 | 1043344131000121 |
7 | 53213050110631 |
oct | 7557215103761 |
9 | 1780780711054 |
10 | 530331240433 |
11 | 194a04183355 |
12 | 86946a39041 |
13 | 3b01902b417 |
14 | 1b94d6546c1 |
15 | dbdd88c53d |
hex | 7b7a3487f1 |
530331240433 has 2 divisors, whose sum is σ = 530331240434. Its totient is φ = 530331240432.
The previous prime is 530331240367. The next prime is 530331240493. The reversal of 530331240433 is 334042133035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 340276222224 + 190055018209 = 583332^2 + 435953^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530331240433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530331240395 and 530331240404.
It is not a weakly prime, because it can be changed into another prime (530331240493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265165620216 + 265165620217.
It is an arithmetic number, because the mean of its divisors is an integer number (265165620217).
Almost surely, 2530331240433 is an apocalyptic number.
It is an amenable number.
530331240433 is a deficient number, since it is larger than the sum of its proper divisors (1).
530331240433 is an equidigital number, since it uses as much as digits as its factorization.
530331240433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 31.
Adding to 530331240433 its reverse (334042133035), we get a palindrome (864373373468).
The spelling of 530331240433 in words is "five hundred thirty billion, three hundred thirty-one million, two hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •