Search a number
-
+
251011020110069 is a prime number
BaseRepresentation
bin111001000100101100001110…
…101100000011100011110101
31012220202102022120111100021002
4321010230032230003203311
5230400031032122010234
62245504512024333045
7103604643035135522
oct7104541654034365
91186672276440232
10251011020110069
1172a861a301010a
122419b74a914185
13aa0a3120c657b
1445dadd909c149
151e0458cb7827e
hexe44b0eb038f5

251011020110069 has 2 divisors, whose sum is σ = 251011020110070. Its totient is φ = 251011020110068.

The previous prime is 251011020110047. The next prime is 251011020110177. The reversal of 251011020110069 is 960011020110152.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 241352164173169 + 9658855936900 = 15535513^2 + 3107870^2 .

It is a cyclic number.

It is not a de Polignac number, because 251011020110069 - 236 = 250942300633333 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2251011020110069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 29.

The spelling of 251011020110069 in words is "two hundred fifty-one trillion, eleven billion, twenty million, one hundred ten thousand, sixty-nine".