Search a number
-
+
1543962293957 is a prime number
BaseRepresentation
bin10110011101111011010…
…100101111011011000101
312110121020101110001201002
4112131323110233123011
5200244013321401312
63141141514143045
7216355552650536
oct26357324573305
95417211401632
101543962293957
11545877511536
1220b291a21a85
13b2797347bb5
1454a2a17468d
152a266b594c2
hex1677b52f6c5

1543962293957 has 2 divisors, whose sum is σ = 1543962293958. Its totient is φ = 1543962293956.

The previous prime is 1543962293921. The next prime is 1543962293977. The reversal of 1543962293957 is 7593922693451.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 834078531841 + 709883762116 = 913279^2 + 842546^2 .

It is a cyclic number.

It is not a de Polignac number, because 1543962293957 - 26 = 1543962293893 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21543962293957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 110224800, while the sum is 65.

The spelling of 1543962293957 in words is "one trillion, five hundred forty-three billion, nine hundred sixty-two million, two hundred ninety-three thousand, nine hundred fifty-seven".