Search a number
-
+
45144119 is a prime number
BaseRepresentation
bin1010110000110…
…1100000110111
310010221120002102
42230031200313
543024102434
64251332315
71055501336
oct254154067
9103846072
1045144119
1123534499
121315109b
1394780c7
145dd1d1d
153e6b07e
hex2b0d837

45144119 has 2 divisors, whose sum is σ = 45144120. Its totient is φ = 45144118.

The previous prime is 45144089. The next prime is 45144137. The reversal of 45144119 is 91144154.

45144119 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 is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-45144119 is a prime.

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

It is a Chen prime.

It is equal to p2726381 and since 45144119 and 2726381 have the same sum of digits, it is a Honaker prime.

It is a junction number, because it is equal to n+sod(n) for n = 45144091 and 45144100.

It is a congruent number.

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

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

Almost surely, 245144119 is an apocalyptic number.

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

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

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

The product of its digits is 2880, while the sum is 29.

The square root of 45144119 is about 6718.9373415742. The cubic root of 45144119 is about 356.0686412902.

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