Search a number
-
+
105005005989967 is a prime number
BaseRepresentation
bin10111111000000001100010…
…000101001110100001001111
3111202210101021102002021221201
4113320001202011032201033
5102230400223013134332
61011154344523010331
731055234636130346
oct2770014205164117
9452711242067851
10105005005989967
1130504411452026
12b93a8100699a7
134678c11385345
141bd03ab378b5d
15c2164b72c5e7
hex5f806214e84f

105005005989967 has 2 divisors, whose sum is σ = 105005005989968. Its totient is φ = 105005005989966.

The previous prime is 105005005989887. The next prime is 105005005990037. The reversal of 105005005989967 is 769989500500501.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 105005005989967 - 227 = 105004871772239 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2105005005989967 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 30618000, while the sum is 64.

The spelling of 105005005989967 in words is "one hundred five trillion, five billion, five million, nine hundred eighty-nine thousand, nine hundred sixty-seven".