Search a number
-
+
114651570433 is a prime number
BaseRepresentation
bin110101011000111000…
…1000010000100000001
3101221221021011020102111
41222301301002010001
53334301300223213
6124400433015321
711166113161201
oct1526161020401
9357837136374
10114651570433
11446949058a4
121a2786b4541
13aa7210234a
145798ca6401
152eb0675a3d
hex1ab1c42101

114651570433 has 2 divisors, whose sum is σ = 114651570434. Its totient is φ = 114651570432.

The previous prime is 114651570431. The next prime is 114651570437. The reversal of 114651570433 is 334075156411.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 104143680369 + 10507890064 = 322713^2 + 102508^2 .

It is a cyclic number.

It is not a de Polignac number, because 114651570433 - 21 = 114651570431 is a prime.

Together with 114651570431, it forms a pair of twin primes.

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

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

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

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

Almost surely, 2114651570433 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 114651570433 in words is "one hundred fourteen billion, six hundred fifty-one million, five hundred seventy thousand, four hundred thirty-three".