Base | Representation |
---|---|
bin | 11111100111010… |
… | …111001001000101 |
3 | 1100222001201121122 |
4 | 133213113021011 |
5 | 2041241141401 |
6 | 124344323325 |
7 | 16100266652 |
oct | 3747271105 |
9 | 1328051548 |
10 | 530412101 |
11 | 25244950a |
12 | 129773545 |
13 | 85b7281b |
14 | 50630c29 |
15 | 3187421b |
hex | 1f9d7245 |
530412101 has 2 divisors, whose sum is σ = 530412102. Its totient is φ = 530412100.
The previous prime is 530412073. The next prime is 530412107. The reversal of 530412101 is 101214035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 496131076 + 34281025 = 22274^2 + 5855^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530412101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 530412101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530412107) 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 as a sum of consecutive naturals, namely, 265206050 + 265206051.
It is an arithmetic number, because the mean of its divisors is an integer number (265206051).
Almost surely, 2530412101 is an apocalyptic number.
It is an amenable number.
530412101 is a deficient number, since it is larger than the sum of its proper divisors (1).
530412101 is an equidigital number, since it uses as much as digits as its factorization.
530412101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 530412101 is about 23030.6773890826. The cubic root of 530412101 is about 809.4769274416.
Adding to 530412101 its reverse (101214035), we get a palindrome (631626136).
The spelling of 530412101 in words is "five hundred thirty million, four hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •