Search a number
-
+
1969281450637 is a prime number
BaseRepresentation
bin11100101010000010010…
…100100100001010001101
320222021001121110212011121
4130222002110210022031
5224231042022410022
64104401515520541
7262163426100064
oct34520224441215
96867047425147
101969281450637
1169a193049006
122797b0459151
13113919366b47
146b456c3d1db
153635b26a2c7
hex1ca8252428d

1969281450637 has 2 divisors, whose sum is σ = 1969281450638. Its totient is φ = 1969281450636.

The previous prime is 1969281450611. The next prime is 1969281450701. The reversal of 1969281450637 is 7360541829691.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1511594021961 + 457687428676 = 1229469^2 + 676526^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1969281450637 is a prime.

It is a congruent number.

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

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

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

It is a 2-persistent number, because it is pandigital, and so is 2⋅1969281450637 = 3938562901274, but 3⋅1969281450637 = 5907844351911 is not.

Almost surely, 21969281450637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19595520, while the sum is 61.

The spelling of 1969281450637 in words is "one trillion, nine hundred sixty-nine billion, two hundred eighty-one million, four hundred fifty thousand, six hundred thirty-seven".