Base | Representation |
---|---|
bin | 11111100111101… |
… | …000101101000011 |
3 | 1100222012101021212 |
4 | 133213220231003 |
5 | 2041300442120 |
6 | 124350040335 |
7 | 16101016454 |
oct | 3747505503 |
9 | 1328171255 |
10 | 530484035 |
11 | 252498564 |
12 | 1297a90ab |
13 | 85b994a3 |
14 | 5064d12b |
15 | 3188a6c5 |
hex | 1f9e8b43 |
530484035 has 8 divisors (see below), whose sum is σ = 652107456. Its totient is φ = 414036160.
The previous prime is 530484011. The next prime is 530484041.
530484035 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-530484035 is a prime.
It is a super-2 number, since 2×5304840352 = 562826622779762450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530483992 and 530484010.
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 7 ways as a sum of consecutive naturals, for example, 1293659 + ... + 1294068.
It is an arithmetic number, because the mean of its divisors is an integer number (81513432).
Almost surely, 2530484035 is an apocalyptic number.
530484035 is a deficient number, since it is larger than the sum of its proper divisors (121623421).
530484035 is a wasteful number, since it uses less digits than its factorization.
530484035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2587773.
The product of its (nonzero) digits is 28800, while the sum is 32.
The square root of 530484035 is about 23032.2390357516. The cubic root of 530484035 is about 809.5135192922.
The spelling of 530484035 in words is "five hundred thirty million, four hundred eighty-four thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •