Base | Representation |
---|---|
bin | 11111100111110… |
… | …010010100001101 |
3 | 1100222021101022000 |
4 | 133213302110031 |
5 | 2041303222110 |
6 | 124350542513 |
7 | 16101242316 |
oct | 3747622415 |
9 | 1328241260 |
10 | 530523405 |
11 | 2525150a5 |
12 | 129807a39 |
13 | 85bb1399 |
14 | 5065d60d |
15 | 318971c0 |
hex | 1f9f250d |
530523405 has 64 divisors (see below), whose sum is σ = 1000650240. Its totient is φ = 266112000.
The previous prime is 530523397. The next prime is 530523443. The reversal of 530523405 is 504325035.
It is not a de Polignac number, because 530523405 - 23 = 530523397 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 an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 188005 + ... + 190805.
It is an arithmetic number, because the mean of its divisors is an integer number (15635160).
Almost surely, 2530523405 is an apocalyptic number.
It is an amenable number.
530523405 is a deficient number, since it is larger than the sum of its proper divisors (470126835).
530523405 is a wasteful number, since it uses less digits than its factorization.
530523405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2899 (or 2893 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 27.
The square root of 530523405 is about 23033.0936914692. The cubic root of 530523405 is about 809.5335448769.
The spelling of 530523405 in words is "five hundred thirty million, five hundred twenty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •