Search a number
-
+
914555500357 is a prime number
BaseRepresentation
bin11010100111011111100…
…00010111011101000101
310020102121221112010001011
431103233300113131011
5104441002202002412
61540050242202221
7123034352326432
oct15235760273505
93212557463034
10914555500357
11322951812734
121292b6953371
136831c1b2c05
143239c580b89
1518bca2dc7a7
hexd4efc17745

914555500357 has 2 divisors, whose sum is σ = 914555500358. Its totient is φ = 914555500356.

The previous prime is 914555500343. The next prime is 914555500459. The reversal of 914555500357 is 753005555419.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 899915952321 + 14639548036 = 948639^2 + 120994^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2914555500357 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 914555500357 in words is "nine hundred fourteen billion, five hundred fifty-five million, five hundred thousand, three hundred fifty-seven".