Search a number
-
+
1304010469 is a prime number
BaseRepresentation
bin100110110111001…
…1001111011100101
310100212201121002001
41031232121323211
510132311313334
6333221245301
744212622536
oct11556317345
93325647061
101304010469
1160a097403
12304863831
1317a210538
14c528668d
1579733714
hex4db99ee5

1304010469 has 2 divisors, whose sum is σ = 1304010470. Its totient is φ = 1304010468.

The previous prime is 1304010397. The next prime is 1304010493. The reversal of 1304010469 is 9640104031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1247007969 + 57002500 = 35313^2 + 7550^2 .

It is a cyclic number.

It is not a de Polignac number, because 1304010469 - 213 = 1304002277 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1304010769) 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, 652005234 + 652005235.

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

Almost surely, 21304010469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 28.

The square root of 1304010469 is about 36111.0851263154. The cubic root of 1304010469 is about 1092.5140379445.

The spelling of 1304010469 in words is "one billion, three hundred four million, ten thousand, four hundred sixty-nine".