Search a number
-
+
1987260051443 is a prime number
BaseRepresentation
bin11100111010110001111…
…011011110111111110011
321000222110120101102000112
4130322301323132333303
5230024402033121233
64120533515411535
7263401104504632
oct34726173367763
97028416342015
101987260051443
116a6879544987
12281189453bab
13115523014184
146c280899519
1536a5e7e8048
hex1ceb1edeff3

1987260051443 has 2 divisors, whose sum is σ = 1987260051444. Its totient is φ = 1987260051442.

The previous prime is 1987260051383. The next prime is 1987260051499. The reversal of 1987260051443 is 3441500627891.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

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

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

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

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

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

It is a 3-persistent number, because k⋅1987260051443 is pandigital for 1 ≤ k ≤ 3, but not for k = 4.

Almost surely, 21987260051443 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1451520, while the sum is 50.

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