Base | Representation |
---|---|
bin | 1111001001100100100… |
… | …01100010111001100011 |
3 | 1211202120221111112210002 |
4 | 13210302101202321203 |
5 | 32012023313044021 |
6 | 1035044044530215 |
7 | 52415221162145 |
oct | 7446221427143 |
9 | 1752527445702 |
10 | 520534503011 |
11 | 19083717a546 |
12 | 84a71b5096b |
13 | 3a11749b283 |
14 | 1b2a04c2c95 |
15 | d81878050b |
hex | 7932462e63 |
520534503011 has 4 divisors (see below), whose sum is σ = 537325938624. Its totient is φ = 503743067400.
The previous prime is 520534502993. The next prime is 520534503019. The reversal of 520534503011 is 110305435025.
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 520534503011 - 214 = 520534486627 is a prime.
It is a super-2 number, since 2×5205345030112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (520534503019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8395717760 + ... + 8395717821.
It is an arithmetic number, because the mean of its divisors is an integer number (134331484656).
Almost surely, 2520534503011 is an apocalyptic number.
520534503011 is a deficient number, since it is larger than the sum of its proper divisors (16791435613).
520534503011 is a wasteful number, since it uses less digits than its factorization.
520534503011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16791435612.
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 520534503011 its reverse (110305435025), we get a palindrome (630839938036).
The spelling of 520534503011 in words is "five hundred twenty billion, five hundred thirty-four million, five hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •