Search a number
-
+
1440271765649 is a prime number
BaseRepresentation
bin10100111101010110111…
…000110001000010010001
312002200121000102110100202
4110331112320301002101
5142044134033000044
63021352434224545
7206025164004353
oct24752670610221
95080530373322
101440271765649
115058a7955942
121b3174125155
13a5a8107cac2
144d9d0d1b0d3
15276e8929c4e
hex14f56e31091

1440271765649 has 2 divisors, whose sum is σ = 1440271765650. Its totient is φ = 1440271765648.

The previous prime is 1440271765619. The next prime is 1440271765651. The reversal of 1440271765649 is 9465671720441.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1366252401424 + 74019364225 = 1168868^2 + 272065^2 .

It is a cyclic number.

It is not a de Polignac number, because 1440271765649 - 28 = 1440271765393 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 1440271765594 and 1440271765603.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21440271765649 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10160640, while the sum is 56.

The spelling of 1440271765649 in words is "one trillion, four hundred forty billion, two hundred seventy-one million, seven hundred sixty-five thousand, six hundred forty-nine".