Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
5731048553 is a prime number
BaseRepresentation
bin1010101011001100…
…01101110001101001
3112210101222102122112
411111212031301221
543214122023203
62344404132105
7262010052236
oct52546156151
915711872575
105731048553
11248103366a
12113b397035
1370444c2b9
143c51dc78d
1523820d6d8
hex15598dc69

5731048553 has 2 divisors, whose sum is σ = 5731048554. Its totient is φ = 5731048552.

The previous prime is 5731048481. The next prime is 5731048571. The reversal of 5731048553 is 3558401375.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3699923929 + 2031124624 = 60827^2 + 45068^2 .

It is a cyclic number.

It is not a de Polignac number, because 5731048553 - 228 = 5462613097 is a prime.

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 5731048553.

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

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

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

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

Almost surely, 25731048553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 252000, while the sum is 41.

The square root of 5731048553 is about 75703.6891637389. The cubic root of 5731048553 is about 1789.5535389762.

The spelling of 5731048553 in words is "five billion, seven hundred thirty-one million, forty-eight thousand, five hundred fifty-three".