Search a number
-
+
102133110114809 is a prime number
BaseRepresentation
bin10111001110001110110111…
…101111111000100111111001
3111101121211102001022211022222
4113032032313233320213321
5101341322102142133214
61001115145243253425
730340605452020634
oct2716166757704771
9441554361284288
10102133110114809
112a5a7455067404
12b5560b7b1a275
1344cb159a0ba57
141b313a9c38c1b
15bc1ab36a638e
hex5ce3b7bf89f9

102133110114809 has 2 divisors, whose sum is σ = 102133110114810. Its totient is φ = 102133110114808.

The previous prime is 102133110114757. The next prime is 102133110114823. The reversal of 102133110114809 is 908411011331201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82659008890000 + 19474101224809 = 9091700^2 + 4412947^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-102133110114809 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 2102133110114809 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 35.

The spelling of 102133110114809 in words is "one hundred two trillion, one hundred thirty-three billion, one hundred ten million, one hundred fourteen thousand, eight hundred nine".