Search a number
-
+
928406044549 is a prime number
BaseRepresentation
bin11011000001010010100…
…11111111111110000101
310021202101012202122210101
431200221103333332011
5110202333421411144
61550300455324101
7124034524112644
oct15405123777605
93252335678711
10928406044549
1132880a010575
1212bb21380631
13697188537a9
1432d13c7135b
151923b24c6d4
hexd8294fff85

928406044549 has 2 divisors, whose sum is σ = 928406044550. Its totient is φ = 928406044548.

The previous prime is 928406044519. The next prime is 928406044571. The reversal of 928406044549 is 945440604829.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 741269340900 + 187136703649 = 860970^2 + 432593^2 .

It is a cyclic number.

It is not a de Polignac number, because 928406044549 - 29 = 928406044037 is a prime.

It is a super-2 number, since 2×9284060445492 (a number of 25 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 928406044549.

It is a congruent number.

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

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

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

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

Almost surely, 2928406044549 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9953280, while the sum is 55.

The spelling of 928406044549 in words is "nine hundred twenty-eight billion, four hundred six million, forty-four thousand, five hundred forty-nine".