Search a number
BaseRepresentation
bin111101010111110110001
310210011122121
413222332301
51003323212
6111034241
723044066
oct7527661
93704577
102011057
111153a34
1280b981
13555499
143a4c6d
hex1eafb1

2011057 has 2 divisors, whose sum is σ = 2011058. Its totient is φ = 2011056.

The previous prime is 2011033. The next prime is 2011069. The reversal of 2011057 is 7501102.

Adding to 2011057 its reverse (7501102), we get a palindrome (9512159).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1934881 + 76176 = 1391^2 + 276^2 .

It is a cyclic number.

It is not a de Polignac number, because 2011057 - 27 = 2010929 is a prime.

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

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

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

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

22011057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70, while the sum is 16.

The square root of 2011057 is about 1418.1174140388. The cubic root of 2011057 is about 126.2238608761.

The spelling of 2011057 in words is "two million, eleven thousand, fifty-seven".