Search a number
-
+
504109481 is a prime number
BaseRepresentation
bin11110000011000…
…001100110101001
31022010120102012112
4132003001212221
52013023000411
6122004452105
715330600641
oct3603014651
91263512175
10504109481
11239613a07
121209aa035
1380593745
144ad45521
152e3cab8b
hex1e0c19a9

504109481 has 2 divisors, whose sum is σ = 504109482. Its totient is φ = 504109480.

The previous prime is 504109477. The next prime is 504109513. The reversal of 504109481 is 184901405.

It is an a-pointer prime, because the next prime (504109513) can be obtained adding 504109481 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 259499881 + 244609600 = 16109^2 + 15640^2 .

It is a cyclic number.

It is not a de Polignac number, because 504109481 - 22 = 504109477 is a prime.

It is a super-2 number, since 2×5041094812 = 508252737668178722, which contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (504109681) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252054740 + 252054741.

It is an arithmetic number, because the mean of its divisors is an integer number (252054741).

Almost surely, 2504109481 is an apocalyptic number.

It is an amenable number.

504109481 is a deficient number, since it is larger than the sum of its proper divisors (1).

504109481 is an equidigital number, since it uses as much as digits as its factorization.

504109481 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 5760, while the sum is 32.

The square root of 504109481 is about 22452.3825239105. The cubic root of 504109481 is about 795.8690605770.

The spelling of 504109481 in words is "five hundred four million, one hundred nine thousand, four hundred eighty-one".