Search a number
-
+
11061672469 is a prime number
BaseRepresentation
bin10100100110101001…
…11011101000010101
31001112220111011221221
422103110323220111
5140123242004334
65025350010341
7541055443651
oct122324735025
931486434857
1011061672469
114767031281
1221886469b1
13107393b933
1476d165a61
1544b1c28b4
hex29353ba15

11061672469 has 2 divisors, whose sum is σ = 11061672470. Its totient is φ = 11061672468.

The previous prime is 11061672467. The next prime is 11061672497. The reversal of 11061672469 is 96427616011.

11061672469 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., 9614783025 + 1446889444 = 98055^2 + 38038^2 .

It is a cyclic number.

It is not a de Polignac number, because 11061672469 - 21 = 11061672467 is a prime.

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

Together with 11061672467, it forms a pair of twin primes.

It is a congruent number.

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

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

Almost surely, 211061672469 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11061672469 in words is "eleven billion, sixty-one million, six hundred seventy-two thousand, four hundred sixty-nine".