Search a number
-
+
100111020967 is a prime number
BaseRepresentation
bin101110100111100010…
…1001111001110100111
3100120101220112210101101
41131033011033032213
53120011410132332
6113553530340531
710142562431536
oct1351705171647
9316356483341
10100111020967
1139503074871
121749ab8a747
139595811719
144bb9ac031d
15290dd69ae7
hex174f14f3a7

100111020967 has 2 divisors, whose sum is σ = 100111020968. Its totient is φ = 100111020966.

The previous prime is 100111020941. The next prime is 100111021057. The reversal of 100111020967 is 769020111001.

It is a weak prime.

It is an emirp because it is prime and its reverse (769020111001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 100111020967 - 215 = 100110988199 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100111020967 is an apocalyptic number.

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

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

100111020967 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 756, while the sum is 28.

Adding to 100111020967 its reverse (769020111001), we get a palindrome (869131131968).

The spelling of 100111020967 in words is "one hundred billion, one hundred eleven million, twenty thousand, nine hundred sixty-seven".