Base | Representation |
---|---|
bin | 1111001001100101001… |
… | …10101001000000000111 |
3 | 1211202121022220111112122 |
4 | 13210302212221000013 |
5 | 32012031222024111 |
6 | 1035044403240155 |
7 | 52415316163514 |
oct | 7446246510007 |
9 | 1752538814478 |
10 | 520540033031 |
11 | 19083a307307 |
12 | 84a7397905b |
13 | 3a118686385 |
14 | 1b2a112230b |
15 | d818ec3cdb |
hex | 79329a9007 |
520540033031 has 8 divisors (see below), whose sum is σ = 558922853664. Its totient is φ = 483019747840.
The previous prime is 520540033003. The next prime is 520540033051. The reversal of 520540033031 is 130330045025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 520540033031 - 26 = 520540032967 is a prime.
It is a super-2 number, since 2×5205400330312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520540033051) 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 in 7 ways as a sum of consecutive naturals, for example, 215632610 + ... + 215635023.
It is an arithmetic number, because the mean of its divisors is an integer number (69865356708).
Almost surely, 2520540033031 is an apocalyptic number.
520540033031 is a deficient number, since it is larger than the sum of its proper divisors (38382820633).
520540033031 is a wasteful number, since it uses less digits than its factorization.
520540033031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431267721.
The product of its (nonzero) digits is 5400, while the sum is 26.
Adding to 520540033031 its reverse (130330045025), we get a palindrome (650870078056).
The spelling of 520540033031 in words is "five hundred twenty billion, five hundred forty million, thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •