Base | Representation |
---|---|
bin | 1111011011110001000… |
… | …10010111011000110111 |
3 | 1212200210202010102012001 |
4 | 13231320202113120313 |
5 | 32142030113031043 |
6 | 1043341251040131 |
7 | 53212260161026 |
oct | 7557042273067 |
9 | 1780722112161 |
10 | 530303252023 |
11 | 19499a3a7236 |
12 | 869395a0047 |
13 | 3b0132abc2c |
14 | 1b949a4a8bd |
15 | dbdb1ae74d |
hex | 7b78897637 |
530303252023 has 2 divisors, whose sum is σ = 530303252024. Its totient is φ = 530303252022.
The previous prime is 530303251999. The next prime is 530303252057. The reversal of 530303252023 is 320252303035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 530303252023 - 217 = 530303120951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530303251982 and 530303252000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530303252623) 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, 265151626011 + 265151626012.
It is an arithmetic number, because the mean of its divisors is an integer number (265151626012).
Almost surely, 2530303252023 is an apocalyptic number.
530303252023 is a deficient number, since it is larger than the sum of its proper divisors (1).
530303252023 is an equidigital number, since it uses as much as digits as its factorization.
530303252023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 28.
Adding to 530303252023 its reverse (320252303035), we get a palindrome (850555555058).
The spelling of 530303252023 in words is "five hundred thirty billion, three hundred three million, two hundred fifty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •