Base | Representation |
---|---|
bin | 1111001001001100101… |
… | …01011101000011010001 |
3 | 1211202001222121011010121 |
4 | 13210212111131003101 |
5 | 32011121023413131 |
6 | 1035012131430241 |
7 | 52410236506324 |
oct | 7444625350321 |
9 | 1752058534117 |
10 | 520334201041 |
11 | 190744100726 |
12 | 84a16a55381 |
13 | 3a0b4b396b5 |
14 | 1b281a627bb |
15 | d805db6911 |
hex | 792655d0d1 |
520334201041 has 8 divisors (see below), whose sum is σ = 521796815168. Its totient is φ = 518872662000.
The previous prime is 520334201029. The next prime is 520334201063. The reversal of 520334201041 is 140102433025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-520334201041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 520334200997 and 520334201015.
It is not an unprimeable number, because it can be changed into a prime (520334202041) 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 7 ways as a sum of consecutive naturals, for example, 705526 + ... + 1240336.
It is an arithmetic number, because the mean of its divisors is an integer number (65224601896).
Almost surely, 2520334201041 is an apocalyptic number.
It is an amenable number.
520334201041 is a deficient number, since it is larger than the sum of its proper divisors (1462614127).
520334201041 is a wasteful number, since it uses less digits than its factorization.
520334201041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537543.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 520334201041 its reverse (140102433025), we get a palindrome (660436634066).
The spelling of 520334201041 in words is "five hundred twenty billion, three hundred thirty-four million, two hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •