Search a number
-
+
114505405115359 is a prime number
BaseRepresentation
bin11010000010010001011101…
…111111110010101111011111
3120000102121110120010111122111
4122002101131333302233133
5110002024032202142414
61043311020143254451
733055512453235216
oct3202213577625737
9500377416114574
10114505405115359
1133537519046445
1210a13ab85aa427
134bb7a75c8926b
14203c13c29c07d
15d38835acb8c4
hex68245dff2bdf

114505405115359 has 2 divisors, whose sum is σ = 114505405115360. Its totient is φ = 114505405115358.

The previous prime is 114505405115291. The next prime is 114505405115383. The reversal of 114505405115359 is 953511504505411.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 114505405115359 - 211 = 114505405113311 is a prime.

It is a super-4 number, since 4×1145054051153594 (a number of 57 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

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

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

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

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

Almost surely, 2114505405115359 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1350000, while the sum is 49.

The spelling of 114505405115359 in words is "one hundred fourteen trillion, five hundred five billion, four hundred five million, one hundred fifteen thousand, three hundred fifty-nine".