Base | Representation |
---|---|
bin | 11111100110010… |
… | …101100011100101 |
3 | 1100221120002010000 |
4 | 133212111203211 |
5 | 2041204042321 |
6 | 124334451513 |
7 | 16065100521 |
oct | 3746254345 |
9 | 1327502100 |
10 | 530143461 |
11 | 2522856a1 |
12 | 129663b99 |
13 | 85aaa473 |
14 | 505a0d81 |
15 | 3181e826 |
hex | 1f9958e5 |
530143461 has 20 divisors (see below), whose sum is σ = 819254700. Its totient is φ = 341240256.
The previous prime is 530143457. The next prime is 530143469. The reversal of 530143461 is 164341035.
It can be written as a sum of positive squares in 2 ways, for example, as 450755361 + 79388100 = 21231^2 + 8910^2 .
It is not a de Polignac number, because 530143461 - 22 = 530143457 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530143469) 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 19 ways as a sum of consecutive naturals, for example, 110496 + ... + 115193.
It is an arithmetic number, because the mean of its divisors is an integer number (40962735).
Almost surely, 2530143461 is an apocalyptic number.
It is an amenable number.
530143461 is a deficient number, since it is larger than the sum of its proper divisors (289111239).
530143461 is a wasteful number, since it uses less digits than its factorization.
530143461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225730 (or 225721 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 530143461 is about 23024.8444294419. The cubic root of 530143461 is about 809.3402446598.
Adding to 530143461 its reverse (164341035), we get a palindrome (694484496).
The spelling of 530143461 in words is "five hundred thirty million, one hundred forty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •