Search a number
-
+
1000075558457 is a prime number
BaseRepresentation
bin11101000110110010010…
…01011111111000111001
310112121100222121012012102
432203121021133320321
5112341123320332312
62043232305553145
7132152542663043
oct16433111377071
93477328535172
101000075558457
113561476430a8
121419a33457b5
13733cab323a1
14365924b4a93
151b0331ddec2
hexe8d925fe39

1000075558457 has 2 divisors, whose sum is σ = 1000075558458. Its totient is φ = 1000075558456.

The previous prime is 1000075558429. The next prime is 1000075558553. The reversal of 1000075558457 is 7548555700001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 992053848361 + 8021710096 = 996019^2 + 89564^2 .

It is a cyclic number.

It is not a de Polignac number, because 1000075558457 - 28 = 1000075558201 is a prime.

It is a super-3 number, since 3×10000755584573 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is not a weakly prime, because it can be changed into another prime (1000075551457) 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, 500037779228 + 500037779229.

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

Almost surely, 21000075558457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 980000, while the sum is 47.

The spelling of 1000075558457 in words is "one trillion, seventy-five million, five hundred fifty-eight thousand, four hundred fifty-seven".