Search a number
-
+
114133016993 is a prime number
BaseRepresentation
bin110101001001011011…
…0111010000110100001
3101220121010101222211112
41222102312322012201
53332221023020433
6124233150353105
711150215431452
oct1522266720641
9356533358745
10114133016993
1144449126a36
121a152abb795
13a9bb8523a8
14574a081129
152e7ed95348
hex1a92dba1a1

114133016993 has 2 divisors, whose sum is σ = 114133016994. Its totient is φ = 114133016992.

The previous prime is 114133016939. The next prime is 114133017029. The reversal of 114133016993 is 399610331411.

Together with previous prime (114133016939) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 60879147169 + 53253869824 = 246737^2 + 230768^2 .

It is a cyclic number.

It is not a de Polignac number, because 114133016993 - 230 = 113059275169 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 114133016993.

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

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

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

Almost surely, 2114133016993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 52488, while the sum is 41.

The spelling of 114133016993 in words is "one hundred fourteen billion, one hundred thirty-three million, sixteen thousand, nine hundred ninety-three".