Base | Representation |
---|---|
bin | 11111100110001… |
… | …111111011010001 |
3 | 1100221111220110221 |
4 | 133212033323101 |
5 | 2041202323101 |
6 | 124334153041 |
7 | 16064643346 |
oct | 3746177321 |
9 | 1327456427 |
10 | 530120401 |
11 | 25226a338 |
12 | 129652781 |
13 | 85a9cb15 |
14 | 505967cd |
15 | 31817aa1 |
hex | 1f98fed1 |
530120401 has 8 divisors (see below), whose sum is σ = 567612360. Its totient is φ = 493329408.
The previous prime is 530120389. The next prime is 530120407. The reversal of 530120401 is 104021035.
It can be written as a sum of positive squares in 4 ways, for example, as 122080401 + 408040000 = 11049^2 + 20200^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 530120401 - 211 = 530118353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530120407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173676 + ... + 176701.
It is an arithmetic number, because the mean of its divisors is an integer number (70951545).
Almost surely, 2530120401 is an apocalyptic number.
It is an amenable number.
530120401 is a deficient number, since it is larger than the sum of its proper divisors (37491959).
530120401 is a wasteful number, since it uses less digits than its factorization.
530120401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350483.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 530120401 is about 23024.3436605693. The cubic root of 530120401 is about 809.3285096874.
Adding to 530120401 its reverse (104021035), we get a palindrome (634141436).
The spelling of 530120401 in words is "five hundred thirty million, one hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •