Base | Representation |
---|---|
bin | 11111101001000… |
… | …011001011100111 |
3 | 1100222220012122122 |
4 | 133221003023213 |
5 | 2041344322011 |
6 | 124402020155 |
7 | 16104122066 |
oct | 3751031347 |
9 | 1328805578 |
10 | 530854631 |
11 | 252720a3a |
12 | 12994765b |
13 | 85c99088 |
14 | 507081dd |
15 | 319103db |
hex | 1fa432e7 |
530854631 has 8 divisors (see below), whose sum is σ = 563207904. Its totient is φ = 498626560.
The previous prime is 530854619. The next prime is 530854669. The reversal of 530854631 is 136458035.
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 530854631 - 26 = 530854567 is a prime.
It is a super-2 number, since 2×5308546312 = 563613278508292322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530854591 and 530854600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530854931) 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 7 ways as a sum of consecutive naturals, for example, 22490 + ... + 39591.
It is an arithmetic number, because the mean of its divisors is an integer number (70400988).
Almost surely, 2530854631 is an apocalyptic number.
530854631 is a deficient number, since it is larger than the sum of its proper divisors (32353273).
530854631 is a wasteful number, since it uses less digits than its factorization.
530854631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62601.
The product of its (nonzero) digits is 43200, while the sum is 35.
The square root of 530854631 is about 23040.2827890632. The cubic root of 530854631 is about 809.7019840521.
The spelling of 530854631 in words is "five hundred thirty million, eight hundred fifty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •