Search a number
-
+
10271643331 is a prime number
BaseRepresentation
bin10011001000011110…
…01101011011000011
3222111211220112201111
421210033031123003
5132014020041311
64415124544151
7512353346005
oct114417153303
928454815644
1010271643331
1143a1090734
121ba7b52057
13c7906a281
146d6274375
15401b69d21
hex2643cd6c3

10271643331 has 2 divisors, whose sum is σ = 10271643332. Its totient is φ = 10271643330.

The previous prime is 10271643281. The next prime is 10271643373. The reversal of 10271643331 is 13334617201.

10271643331 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 is a cyclic number.

It is not a de Polignac number, because 10271643331 - 217 = 10271512259 is a prime.

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

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

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

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

Almost surely, 210271643331 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9072, while the sum is 31.

The spelling of 10271643331 in words is "ten billion, two hundred seventy-one million, six hundred forty-three thousand, three hundred thirty-one".