Search a number
-
+
114045250729 is a prime number
BaseRepresentation
bin110101000110110100…
…0000110110010101001
3101220101000021000011011
41222031220012302221
53332031041010404
6124220333303521
711145101431234
oct1521550066251
9356330230134
10114045250729
1144403630933
121a129634ba1
13a9a66030a7
14573c55641b
152e7730a604
hex1a8da06ca9

114045250729 has 2 divisors, whose sum is σ = 114045250730. Its totient is φ = 114045250728.

The previous prime is 114045250663. The next prime is 114045250763. The reversal of 114045250729 is 927052540411.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 111771868329 + 2273382400 = 334323^2 + 47680^2 .

It is a cyclic number.

It is not a de Polignac number, because 114045250729 - 221 = 114043153577 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 114045250691 and 114045250700.

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

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

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

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

Almost surely, 2114045250729 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 100800, while the sum is 40.

The spelling of 114045250729 in words is "one hundred fourteen billion, forty-five million, two hundred fifty thousand, seven hundred twenty-nine".