Search a number
-
+
911120102231 is a prime number
BaseRepresentation
bin11010100001000101111…
…11010111001101010111
310020002202112012210202112
431100202333113031113
5104411433221232411
61534321321501235
7122553256041443
oct15204277271527
93202675183675
10911120102231
113214495aa229
121286b834181b
1367bc2545061
14321541db823
1518a788e1b8b
hexd422fd7357

911120102231 has 2 divisors, whose sum is σ = 911120102232. Its totient is φ = 911120102230.

The previous prime is 911120102177. The next prime is 911120102237. The reversal of 911120102231 is 132201021119.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 911120102231 - 214 = 911120085847 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2911120102231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 23.

The spelling of 911120102231 in words is "nine hundred eleven billion, one hundred twenty million, one hundred two thousand, two hundred thirty-one".