Search a number
-
+
10659904081 is a prime number
BaseRepresentation
bin10011110110110000…
…10011101001010001
31000111220111020100021
421323120103221101
5133312413412311
64521434423441
7525106455361
oct117330235121
930456436307
1010659904081
114580268792
122095b91b81
13100b62b468
14731a609a1
15425cb0171
hex27b613a51

10659904081 has 2 divisors, whose sum is σ = 10659904082. Its totient is φ = 10659904080.

The previous prime is 10659904069. The next prime is 10659904091. The reversal of 10659904081 is 18040995601.

10659904081 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., 10638891025 + 21013056 = 103145^2 + 4584^2 .

It is a cyclic number.

It is not a de Polignac number, because 10659904081 - 217 = 10659773009 is a prime.

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

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

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

Almost surely, 210659904081 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 77760, while the sum is 43.

The spelling of 10659904081 in words is "ten billion, six hundred fifty-nine million, nine hundred four thousand, eighty-one".