Search a number
-
+
254022615113 is a prime number
BaseRepresentation
bin1110110010010011101…
…1011000000001001001
3220021200021100212200012
43230210323120001021
513130214242140423
6312410230121305
724231626413421
oct3544473300111
9807607325605
10254022615113
1198804164553
12412937b0235
131ac5359b117
14c41ab71481
15691b05a078
hex3b24ed8049

254022615113 has 2 divisors, whose sum is σ = 254022615114. Its totient is φ = 254022615112.

The previous prime is 254022615059. The next prime is 254022615149. The reversal of 254022615113 is 311516220452.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 241069216144 + 12953398969 = 490988^2 + 113813^2 .

It is a cyclic number.

It is not a de Polignac number, because 254022615113 - 234 = 236842745929 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 254022615113.

It is not a weakly prime, because it can be changed into another prime (254022615163) 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, 127011307556 + 127011307557.

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

Almost surely, 2254022615113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14400, while the sum is 32.

Adding to 254022615113 its reverse (311516220452), we get a palindrome (565538835565).

The spelling of 254022615113 in words is "two hundred fifty-four billion, twenty-two million, six hundred fifteen thousand, one hundred thirteen".