Search a number
-
+
2011065169 is a prime number
BaseRepresentation
bin111011111011110…
…0110101101010001
312012011011200210011
41313313212231101
513104313041134
6531320034521
7100556525521
oct16767465521
95164150704
102011065169
11942215033
12481602a41
1326084c9b9
14151139681
15bb84b264
hex77de6b51

2011065169 has 2 divisors, whose sum is σ = 2011065170. Its totient is φ = 2011065168.

The previous prime is 2011065137. The next prime is 2011065197. The reversal of 2011065169 is 9615601102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2010625600 + 439569 = 44840^2 + 663^2 .

It is a cyclic number.

It is not a de Polignac number, because 2011065169 - 25 = 2011065137 is a prime.

It is a super-2 number, since 2×20110651692 = 8088766227929997122, which contains 22 as substring.

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

It is not a weakly prime, because it can be changed into another prime (2011065109) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005532584 + 1005532585.

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

Almost surely, 22011065169 is an apocalyptic number.

It is an amenable number.

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

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

2011065169 is an evil number, because the sum of its binary digits is even.

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

The square root of 2011065169 is about 44844.9012597865. The cubic root of 2011065169 is about 1262.2403178477.

The spelling of 2011065169 in words is "two billion, eleven million, sixty-five thousand, one hundred sixty-nine".