Search a number
-
+
11066316257 is a prime number
BaseRepresentation
bin10100100111001101…
…01001010111100001
31001120020020010001002
422103212221113201
5140130434110012
65030033321345
7541143064463
oct122346512741
931506203032
1011066316257
114769713217
12218a106255
1310748a6539
1476da14133
1544b7dd7c2
hex2939a95e1

11066316257 has 2 divisors, whose sum is σ = 11066316258. Its totient is φ = 11066316256.

The previous prime is 11066316251. The next prime is 11066316269. The reversal of 11066316257 is 75261366011.

11066316257 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., 11053578496 + 12737761 = 105136^2 + 3569^2 .

It is a cyclic number.

It is not a de Polignac number, because 11066316257 - 24 = 11066316241 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11066316257.

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

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

Almost surely, 211066316257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 45360, while the sum is 38.

The spelling of 11066316257 in words is "eleven billion, sixty-six million, three hundred sixteen thousand, two hundred fifty-seven".