Search a number
-
+
111001010100931 is a prime number
BaseRepresentation
bin11001001111010001101111…
…110001101101101011000011
3112120000121000020122122120201
4121033101233301231223003
5104022120032041212211
61032025054324150031
732244362336136346
oct3117215761555303
9476017006578521
10111001010100931
113240629a458945
12105488a5838317
1349c2472902952
141d5a6985a445d
15cc75ce9a30c1
hex64f46fc6dac3

111001010100931 has 2 divisors, whose sum is σ = 111001010100932. Its totient is φ = 111001010100930.

The previous prime is 111001010100917. The next prime is 111001010100949. The reversal of 111001010100931 is 139001010100111.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 111001010100931 - 215 = 111001010068163 is a prime.

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

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

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

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

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

Almost surely, 2111001010100931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 19.

The spelling of 111001010100931 in words is "one hundred eleven trillion, one billion, ten million, one hundred thousand, nine hundred thirty-one".