Base | Representation |
---|---|
bin | 1111011100010110000… |
… | …00000111010111000011 |
3 | 1212201121100001022012021 |
4 | 13232023000013113003 |
5 | 32143143414244304 |
6 | 1043432114542311 |
7 | 53223041266456 |
oct | 7561300072703 |
9 | 1781540038167 |
10 | 530613040579 |
11 | 195039256a36 |
12 | 86a05297997 |
13 | 3b06252627b |
14 | 1b978c4b49d |
15 | dc084a3a54 |
hex | 7b8b0075c3 |
530613040579 has 4 divisors (see below), whose sum is σ = 542952878776. Its totient is φ = 518273202384.
The previous prime is 530613040547. The next prime is 530613040591. The reversal of 530613040579 is 975040316035.
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 530613040579 - 25 = 530613040547 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43), and also a Moran number because the ratio is a prime number: 12339838153 = 530613040579 / (5 + 3 + 0 + 6 + 1 + 3 + 0 + 4 + 0 + 5 + 7 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530613040879) 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, 6169919034 + ... + 6169919119.
It is an arithmetic number, because the mean of its divisors is an integer number (135738219694).
Almost surely, 2530613040579 is an apocalyptic number.
530613040579 is a deficient number, since it is larger than the sum of its proper divisors (12339838197).
530613040579 is a wasteful number, since it uses less digits than its factorization.
530613040579 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12339838196.
The product of its (nonzero) digits is 340200, while the sum is 43.
The spelling of 530613040579 in words is "five hundred thirty billion, six hundred thirteen million, forty thousand, five hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •