Base | Representation |
---|---|
bin | 1111001001000000101… |
… | …01010101000100001001 |
3 | 1211201210222010021011211 |
4 | 13210200111111010021 |
5 | 32010414234130113 |
6 | 1034554133253121 |
7 | 52404604555054 |
oct | 7444025250411 |
9 | 1751728107154 |
10 | 520233505033 |
11 | 1906a2284290 |
12 | 849a91941a1 |
13 | 3a09a011168 |
14 | 1b27252da9b |
15 | d7ec125b3d |
hex | 7920555109 |
520233505033 has 4 divisors (see below), whose sum is σ = 567527460048. Its totient is φ = 472939550020.
The previous prime is 520233505031. The next prime is 520233505069. The reversal of 520233505033 is 330505332025.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 520233505033 - 21 = 520233505031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 520233504986 and 520233505004.
It is not an unprimeable number, because it can be changed into a prime (520233505031) 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, 23646977491 + ... + 23646977512.
It is an arithmetic number, because the mean of its divisors is an integer number (141881865012).
Almost surely, 2520233505033 is an apocalyptic number.
It is an amenable number.
520233505033 is a deficient number, since it is larger than the sum of its proper divisors (47293955015).
520233505033 is a wasteful number, since it uses less digits than its factorization.
520233505033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47293955014.
The product of its (nonzero) digits is 40500, while the sum is 31.
Adding to 520233505033 its reverse (330505332025), we get a palindrome (850738837058).
The spelling of 520233505033 in words is "five hundred twenty billion, two hundred thirty-three million, five hundred five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •