Search a number
-
+
114030515201131 is a prime number
BaseRepresentation
bin11001111011010111001100…
…010110100010010001101011
3112221202012200122222022111201
4121323113030112202101223
5104421233443342414011
61042304521232305031
733006301316456644
oct3173271426422153
9487665618868451
10114030515201131
1133374085075051
1210957a649a2177
134b8205410a109
14202316bcba6cb
15d2b2de663cc1
hex67b5cc5a246b

114030515201131 has 2 divisors, whose sum is σ = 114030515201132. Its totient is φ = 114030515201130.

The previous prime is 114030515201087. The next prime is 114030515201143. The reversal of 114030515201131 is 131102515030411.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 114030515201131 - 233 = 114021925266539 is a prime.

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

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

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

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

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

Almost surely, 2114030515201131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1800, while the sum is 28.

The spelling of 114030515201131 in words is "one hundred fourteen trillion, thirty billion, five hundred fifteen million, two hundred one thousand, one hundred thirty-one".