Base | Representation |
---|---|
bin | 11111101001001… |
… | …111001110101101 |
3 | 1100222222201100102 |
4 | 133221033032231 |
5 | 2041402411411 |
6 | 124403040445 |
7 | 16104416006 |
oct | 3751171655 |
9 | 1328881312 |
10 | 530903981 |
11 | 252755023 |
12 | 129970125 |
13 | 85cb568a |
14 | 5071c1ad |
15 | 3191ed3b |
hex | 1fa4f3ad |
530903981 has 2 divisors, whose sum is σ = 530903982. Its totient is φ = 530903980.
The previous prime is 530903977. The next prime is 530904013. The reversal of 530903981 is 189309035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 443481481 + 87422500 = 21059^2 + 9350^2 .
It is a cyclic number.
It is not a de Polignac number, because 530903981 - 22 = 530903977 is a prime.
It is a super-2 number, since 2×5309039812 = 563718074083296722, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (535903981) 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 as a sum of consecutive naturals, namely, 265451990 + 265451991.
It is an arithmetic number, because the mean of its divisors is an integer number (265451991).
Almost surely, 2530903981 is an apocalyptic number.
It is an amenable number.
530903981 is a deficient number, since it is larger than the sum of its proper divisors (1).
530903981 is an equidigital number, since it uses as much as digits as its factorization.
530903981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 38.
The square root of 530903981 is about 23041.3537145715. The cubic root of 530903981 is about 809.7270741316.
The spelling of 530903981 in words is "five hundred thirty million, nine hundred three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •