Base | Representation |
---|---|
bin | 11111100110010… |
… | …110000100011001 |
3 | 1100221120011222210 |
4 | 133212112010121 |
5 | 2041204124221 |
6 | 124334505333 |
7 | 16065106611 |
oct | 3746260431 |
9 | 1327504883 |
10 | 530145561 |
11 | 252287230 |
12 | 129665249 |
13 | 85aab3ca |
14 | 505a1a41 |
15 | 31820276 |
hex | 1f996119 |
530145561 has 64 divisors (see below), whose sum is σ = 860461056. Its totient is φ = 286387200.
The previous prime is 530145557. The next prime is 530145593. The reversal of 530145561 is 165541035.
It is not a de Polignac number, because 530145561 - 22 = 530145557 is a prime.
It is not an unprimeable number, because it can be changed into a prime (530145461) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2335330 + ... + 2335556.
It is an arithmetic number, because the mean of its divisors is an integer number (13444704).
Almost surely, 2530145561 is an apocalyptic number.
530145561 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
530145561 is a deficient number, since it is larger than the sum of its proper divisors (330315495).
530145561 is a wasteful number, since it uses less digits than its factorization.
530145561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462.
The product of its (nonzero) digits is 9000, while the sum is 30.
The square root of 530145561 is about 23024.8900323107. The cubic root of 530145561 is about 809.3413133090.
Adding to 530145561 its reverse (165541035), we get a palindrome (695686596).
The spelling of 530145561 in words is "five hundred thirty million, one hundred forty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •