Search a number
-
+
990113567 is a prime number
BaseRepresentation
bin111011000000111…
…110111100011111
32120000001222110212
4323000332330133
54011432113232
6242125323035
733351553322
oct7300767437
92500058425
10990113567
11468990a83
1223770647b
1312a188221
14956d67b9
155bdcbeb2
hex3b03ef1f

990113567 has 2 divisors, whose sum is σ = 990113568. Its totient is φ = 990113566.

The previous prime is 990113561. The next prime is 990113573. The reversal of 990113567 is 765311099.

It is a balanced prime because it is at equal distance from previous prime (990113561) and next prime (990113573).

It is a cyclic number.

It is not a de Polignac number, because 990113567 - 214 = 990097183 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 2990113567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 51030, while the sum is 41.

The square root of 990113567 is about 31466.0700914493. The cubic root of 990113567 is about 996.6936021152.

The spelling of 990113567 in words is "nine hundred ninety million, one hundred thirteen thousand, five hundred sixty-seven".