Base | Representation |
---|---|
bin | 11111100110000… |
… | …010010011110111 |
3 | 1100221102001222101 |
4 | 133212002103313 |
5 | 2041144032011 |
6 | 124333042531 |
7 | 16064321635 |
oct | 3746022367 |
9 | 1327361871 |
10 | 530064631 |
11 | 252231448 |
12 | 129626447 |
13 | 85a80615 |
14 | 50580355 |
15 | 318062c1 |
hex | 1f9824f7 |
530064631 has 4 divisors (see below), whose sum is σ = 531951264. Its totient is φ = 528178000.
The previous prime is 530064617. The next prime is 530064649. The reversal of 530064631 is 136460035.
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 530064631 - 27 = 530064503 is a prime.
It is a super-2 number, since 2×5300646312 = 561937026074332322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 530064631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530014631) 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 3 ways as a sum of consecutive naturals, for example, 942895 + ... + 943456.
It is an arithmetic number, because the mean of its divisors is an integer number (132987816).
Almost surely, 2530064631 is an apocalyptic number.
530064631 is a deficient number, since it is larger than the sum of its proper divisors (1886633).
530064631 is a wasteful number, since it uses less digits than its factorization.
530064631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1886632.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 530064631 is about 23023.1325192729. The cubic root of 530064631 is about 809.3001275602.
The spelling of 530064631 in words is "five hundred thirty million, sixty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •