Search a number
-
+
10114926281 is a prime number
BaseRepresentation
bin10010110101110010…
…11000011011001001
3222002221000111100022
421122321120123021
5131203410120111
64351405550225
7505441311665
oct113271303311
928087014308
1010114926281
114320680909
121b63575375
13c52758ba5
146bd51b8a5
153e30102db
hex25ae586c9

10114926281 has 2 divisors, whose sum is σ = 10114926282. Its totient is φ = 10114926280.

The previous prime is 10114926253. The next prime is 10114926293. The reversal of 10114926281 is 18262941101.

10114926281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6454676281 + 3660250000 = 80341^2 + 60500^2 .

It is a cyclic number.

It is not a de Polignac number, because 10114926281 - 222 = 10110731977 is a prime.

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

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

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

Almost surely, 210114926281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6912, while the sum is 35.

The spelling of 10114926281 in words is "ten billion, one hundred fourteen million, nine hundred twenty-six thousand, two hundred eighty-one".