Search a number
-
+
2145144036869 is a prime number
BaseRepresentation
bin11111001101110100100…
…011000101111000000101
321121001222202221212201022
4133031310203011320011
5240121223333134434
64321244321240525
7310660445314301
oct37156443057005
97531882855638
102145144036869
11757828980a69
122a78b0493145
13127394a76862
1475b7b354d01
153ac0060822e
hex1f3748c5e05

2145144036869 has 2 divisors, whose sum is σ = 2145144036870. Its totient is φ = 2145144036868.

The previous prime is 2145144036863. The next prime is 2145144036881. The reversal of 2145144036869 is 9686304415412.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1763751331969 + 381392704900 = 1328063^2 + 617570^2 .

It is a cyclic number.

It is not a de Polignac number, because 2145144036869 - 240 = 1045632409093 is a prime.

It is a super-2 number, since 2×21451440368692 (a number of 25 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 22145144036869 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4976640, while the sum is 53.

The spelling of 2145144036869 in words is "two trillion, one hundred forty-five billion, one hundred forty-four million, thirty-six thousand, eight hundred sixty-nine".