Base | Representation |
---|---|
bin | 11111100101110… |
… | …110000111101101 |
3 | 1100221022112111010 |
4 | 133211312013231 |
5 | 2041140432301 |
6 | 124332015433 |
7 | 16064023236 |
oct | 3745660755 |
9 | 1327275433 |
10 | 530014701 |
11 | 2521a7987 |
12 | 129601579 |
13 | 85a63988 |
14 | 5056a08d |
15 | 317e65d6 |
hex | 1f9761ed |
530014701 has 8 divisors (see below), whose sum is σ = 731054880. Its totient is φ = 341158832.
The previous prime is 530014697. The next prime is 530014703. The reversal of 530014701 is 107410035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 530014701 - 22 = 530014697 is a prime.
It is a super-2 number, since 2×5300147012 = 561831166552238802, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530014703) 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, 3045975 + ... + 3046148.
It is an arithmetic number, because the mean of its divisors is an integer number (91381860).
Almost surely, 2530014701 is an apocalyptic number.
It is an amenable number.
530014701 is a deficient number, since it is larger than the sum of its proper divisors (201040179).
530014701 is a wasteful number, since it uses less digits than its factorization.
530014701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6092155.
The product of its (nonzero) digits is 420, while the sum is 21.
The square root of 530014701 is about 23022.0481495457. The cubic root of 530014701 is about 809.2747158010.
Adding to 530014701 its reverse (107410035), we get a palindrome (637424736).
The spelling of 530014701 in words is "five hundred thirty million, fourteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •