Base | Representation |
---|---|
bin | 11111101001000… |
… | …111000010011111 |
3 | 1100222221000022211 |
4 | 133221013002133 |
5 | 2041400323211 |
6 | 124402221251 |
7 | 16104216130 |
oct | 3751070237 |
9 | 1328830284 |
10 | 530870431 |
11 | 2527318a3 |
12 | 129954827 |
13 | 85ca3320 |
14 | 5070dc87 |
15 | 31914e21 |
hex | 1fa4709f |
530870431 has 32 divisors (see below), whose sum is σ = 690278400. Its totient is φ = 396472320.
The previous prime is 530870423. The next prime is 530870437. The reversal of 530870431 is 134078035.
It is a cyclic number.
It is not a de Polignac number, because 530870431 - 23 = 530870423 is a prime.
It is a super-2 number, since 2×5308704312 = 563646829020251522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530870393 and 530870402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530870437) 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 31 ways as a sum of consecutive naturals, for example, 827871 + ... + 828511.
It is an arithmetic number, because the mean of its divisors is an integer number (21571200).
Almost surely, 2530870431 is an apocalyptic number.
530870431 is a deficient number, since it is larger than the sum of its proper divisors (159407969).
530870431 is a wasteful number, since it uses less digits than its factorization.
530870431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 530870431 is about 23040.6256642479. The cubic root of 530870431 is about 809.7100171140.
The spelling of 530870431 in words is "five hundred thirty million, eight hundred seventy thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •