Search a number
-
+
1543426032397 is a prime number
BaseRepresentation
bin10110011101011011010…
…111000100001100001101
312110112212000101011010211
4112131123113010030031
5200241414031014042
63141012400202421
7216336351546004
oct26353327041415
95415760334124
101543426032397
11545621838267
1220b162309411
13b2710207a72
14549b8c5dc3b
152a234a2c017
hex1675b5c430d

1543426032397 has 2 divisors, whose sum is σ = 1543426032398. Its totient is φ = 1543426032396.

The previous prime is 1543426032389. The next prime is 1543426032409. The reversal of 1543426032397 is 7932306243451.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 780574017001 + 762852015396 = 883501^2 + 873414^2 .

It is a cyclic number.

It is not a de Polignac number, because 1543426032397 - 23 = 1543426032389 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21543426032397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 49.

The spelling of 1543426032397 in words is "one trillion, five hundred forty-three billion, four hundred twenty-six million, thirty-two thousand, three hundred ninety-seven".