Search a number
-
+
11114031029701 is a prime number
BaseRepresentation
bin1010000110111010111111…
…0111110001110111000101
31110100111020221011011212211
42201232233313301313011
52424043013420422301
635345414304143421
72224651023015055
oct241565767616705
943314227134784
1011114031029701
1135a5485857326
1212b5b82607b71
13628082ab8222
142a5cc9c69565
1514417c606051
hexa1bafdf1dc5

11114031029701 has 2 divisors, whose sum is σ = 11114031029702. Its totient is φ = 11114031029700.

The previous prime is 11114031029693. The next prime is 11114031029707. The reversal of 11114031029701 is 10792013041111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10852346604100 + 261684425601 = 3294290^2 + 511551^2 .

It is a cyclic number.

It is not a de Polignac number, because 11114031029701 - 23 = 11114031029693 is a prime.

It is a congruent number.

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

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

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

Almost surely, 211114031029701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 31.

The spelling of 11114031029701 in words is "eleven trillion, one hundred fourteen billion, thirty-one million, twenty-nine thousand, seven hundred one".