Base | Representation |
---|---|
bin | 11111100101110… |
… | …011000011000011 |
3 | 1100221021220012222 |
4 | 133211303003003 |
5 | 2041140031430 |
6 | 124331441255 |
7 | 16063641446 |
oct | 3745630303 |
9 | 1327256188 |
10 | 530002115 |
11 | 252199485 |
12 | 1295b622b |
13 | 85a5b026 |
14 | 5056565d |
15 | 317e29e5 |
hex | 1f9730c3 |
530002115 has 32 divisors (see below), whose sum is σ = 702535680. Its totient is φ = 382040064.
The previous prime is 530002103. The next prime is 530002147. The reversal of 530002115 is 511200035.
It is a cyclic number.
It is not a de Polignac number, because 530002115 - 212 = 529998019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 530002093 and 530002102.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 312209 + ... + 313901.
It is an arithmetic number, because the mean of its divisors is an integer number (21954240).
Almost surely, 2530002115 is an apocalyptic number.
530002115 is a deficient number, since it is larger than the sum of its proper divisors (172533565).
530002115 is a wasteful number, since it uses less digits than its factorization.
530002115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1871.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 530002115 is about 23021.7748012615. The cubic root of 530002115 is about 809.2683099333.
The spelling of 530002115 in words is "five hundred thirty million, two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •