Search a number
-
+
1451057 is a prime number
BaseRepresentation
bin101100010010000110001
32201201110212
411202100301
5332413212
651033505
715222326
oct5422061
92651425
101451057
11901223
1259b895
133ba61a
1429ab4d
151d9e22
hex162431

1451057 has 2 divisors, whose sum is σ = 1451058. Its totient is φ = 1451056.

The previous prime is 1451053. The next prime is 1451059. The reversal of 1451057 is 7501541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1437601 + 13456 = 1199^2 + 116^2 .

It is an emirp because it is prime and its reverse (7501541) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1451057 - 22 = 1451053 is a prime.

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

It is a Chen prime.

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

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

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

21451057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 700, while the sum is 23.

The square root of 1451057 is about 1204.5982732845. The cubic root of 1451057 is about 113.2126155992.

Adding to 1451057 its reverse (7501541), we get a palindrome (8952598).

The spelling of 1451057 in words is "one million, four hundred fifty-one thousand, fifty-seven".