Base | Representation |
---|---|
bin | 11111100110011… |
… | …001101111110111 |
3 | 1100221120221122221 |
4 | 133212121233313 |
5 | 2041210120011 |
6 | 124335103211 |
7 | 16065201550 |
oct | 3746315767 |
9 | 1327527587 |
10 | 530160631 |
11 | 252297590 |
12 | 129671b07 |
13 | 85ab5220 |
14 | 505a7327 |
15 | 31824971 |
hex | 1f999bf7 |
530160631 has 64 divisors (see below), whose sum is σ = 741565440. Its totient is φ = 365783040.
The previous prime is 530160619. The next prime is 530160647. The reversal of 530160631 is 136061035.
It is not a de Polignac number, because 530160631 - 27 = 530160503 is a prime.
It is a super-2 number, since 2×5301606312 = 562140589324636322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530160596 and 530160605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530160661) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4691631 + ... + 4691743.
It is an arithmetic number, because the mean of its divisors is an integer number (11586960).
Almost surely, 2530160631 is an apocalyptic number.
530160631 is a deficient number, since it is larger than the sum of its proper divisors (211404809).
530160631 is a wasteful number, since it uses less digits than its factorization.
530160631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296.
The product of its (nonzero) digits is 1620, while the sum is 25.
The square root of 530160631 is about 23025.2172845339. The cubic root of 530160631 is about 809.3489820570.
It can be divided in two parts, 530 and 160631, that added together give a palindrome (161161).
The spelling of 530160631 in words is "five hundred thirty million, one hundred sixty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.348 sec. • engine limits •