Base | Representation |
---|---|
bin | 1111011011100100110… |
… | …10011100000000111011 |
3 | 1212200112120210121100022 |
4 | 13231302122130000323 |
5 | 32141322312314043 |
6 | 1043323141001055 |
7 | 53206601660105 |
oct | 7556232340073 |
9 | 1780476717308 |
10 | 530200510523 |
11 | 194947403002 |
12 | 8690b0b318b |
13 | 3acc7c18648 |
14 | 1b93a144575 |
15 | dbd2167868 |
hex | 7b7269c03b |
530200510523 has 4 divisors (see below), whose sum is σ = 536157819720. Its totient is φ = 524243201328.
The previous prime is 530200510519. The next prime is 530200510531. The reversal of 530200510523 is 325015002035.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 530200510523 - 22 = 530200510519 is a prime.
It is a super-2 number, since 2×5302005105232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530200510492 and 530200510501.
It is not an unprimeable number, because it can be changed into a prime (530200516523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2978654465 + ... + 2978654642.
It is an arithmetic number, because the mean of its divisors is an integer number (134039454930).
Almost surely, 2530200510523 is an apocalyptic number.
530200510523 is a deficient number, since it is larger than the sum of its proper divisors (5957309197).
530200510523 is an equidigital number, since it uses as much as digits as its factorization.
530200510523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5957309196.
The product of its (nonzero) digits is 4500, while the sum is 26.
Adding to 530200510523 its reverse (325015002035), we get a palindrome (855215512558).
The spelling of 530200510523 in words is "five hundred thirty billion, two hundred million, five hundred ten thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •