Base | Representation |
---|---|
bin | 11111100101110… |
… | …010100010010111 |
3 | 1100221021210100111 |
4 | 133211302202113 |
5 | 2041140000043 |
6 | 124331423451 |
7 | 16063632400 |
oct | 3745624227 |
9 | 1327253314 |
10 | 530000023 |
11 | 252197953 |
12 | 1295b4b87 |
13 | 85a5a0a7 |
14 | 505649a7 |
15 | 317e209d |
hex | 1f972897 |
530000023 has 6 divisors (see below), whose sum is σ = 616530696. Its totient is φ = 454285692.
The previous prime is 530000021. The next prime is 530000033. The reversal of 530000023 is 320000035.
It is not a de Polignac number, because 530000023 - 21 = 530000021 is a prime.
It is a super-3 number, since 3×5300000233 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 529999958 and 530000012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530000021) 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 5 ways as a sum of consecutive naturals, for example, 5408115 + ... + 5408212.
It is an arithmetic number, because the mean of its divisors is an integer number (102755116).
Almost surely, 2530000023 is an apocalyptic number.
530000023 is a deficient number, since it is larger than the sum of its proper divisors (86530673).
530000023 is a wasteful number, since it uses less digits than its factorization.
530000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10816341 (or 10816334 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 13.
The square root of 530000023 is about 23021.7293659708. The cubic root of 530000023 is about 809.2672451630.
Adding to 530000023 its reverse (320000035), we get a palindrome (850000058).
The spelling of 530000023 in words is "five hundred thirty million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •