Search a number
-
+
1460250053357 is a prime number
BaseRepresentation
bin10101001111111101101…
…011111000101011101101
312011121011100002121221112
4111033331223320223231
5142411043003201412
63034455110241405
7210333233441204
oct25177553705355
95147140077845
101460250053357
1151331a0a5117
121b700a956265
13a79160c4b14
145096839023b
1527eb7807722
hex153fdaf8aed

1460250053357 has 2 divisors, whose sum is σ = 1460250053358. Its totient is φ = 1460250053356.

The previous prime is 1460250053287. The next prime is 1460250053359. The reversal of 1460250053357 is 7533500520641.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1344368361961 + 115881691396 = 1159469^2 + 340414^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1460250053357 - 222 = 1460245859053 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21460250053357 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 378000, while the sum is 41.

Adding to 1460250053357 its reverse (7533500520641), we get a palindrome (8993750573998).

The spelling of 1460250053357 in words is "one trillion, four hundred sixty billion, two hundred fifty million, fifty-three thousand, three hundred fifty-seven".