Search a number
-
+
45400501 is a prime number
BaseRepresentation
bin1010110100110…
…0000110110101
310011102120210001
42231030012311
543110304001
64301031301
71060616656
oct255140665
9104376701
1045400501
112369a083
1213255531
139537a03
14605b52d
153ebc001
hex2b4c1b5

45400501 has 2 divisors, whose sum is σ = 45400502. Its totient is φ = 45400500.

The previous prime is 45400493. The next prime is 45400507. The reversal of 45400501 is 10500454.

45400501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 33942276 + 11458225 = 5826^2 + 3385^2 .

It is a cyclic number.

It is not a de Polignac number, because 45400501 - 23 = 45400493 is a prime.

It is a super-2 number, since 2×454005012 = 4122410982102002, 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 (45400507) 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, 22700250 + 22700251.

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

Almost surely, 245400501 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 400, while the sum is 19.

The square root of 45400501 is about 6737.9893885342. The cubic root of 45400501 is about 356.7414296744.

Adding to 45400501 its reverse (10500454), we get a palindrome (55900955).

The spelling of 45400501 in words is "forty-five million, four hundred thousand, five hundred one".