Search a number
-
+
11071632641 is a prime number
BaseRepresentation
bin10100100111110101…
…11011010100000001
31001120121020012202012
422103322323110001
5140133314221031
65030343302305
7541236216236
oct122372732401
931517205665
1011071632641
114771714523
12218ba4a995
131075a18324
147705d978d
1544beddb2b
hex293ebb501

11071632641 has 2 divisors, whose sum is σ = 11071632642. Its totient is φ = 11071632640.

The previous prime is 11071632623. The next prime is 11071632679. The reversal of 11071632641 is 14623617011.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7288890625 + 3782742016 = 85375^2 + 61504^2 .

It is a cyclic number.

It is not a de Polignac number, because 11071632641 - 222 = 11067438337 is a prime.

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

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

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

Almost surely, 211071632641 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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