Search a number
-
+
1000000055557 is a prime number
BaseRepresentation
bin11101000110101001010…
…01011110100100000101
310112121011201112020200201
432203110221132210011
5112341000003234212
62043221011410501
7132150635140006
oct16432451364405
93477151466621
101000000055557
11356108a63708
12141981bb3a31
13733b82b7c09
143658645d1ad
151b02b777b57
hexe8d4a5e905

1000000055557 has 2 divisors, whose sum is σ = 1000000055558. Its totient is φ = 1000000055556.

The previous prime is 1000000055539. The next prime is 1000000055563. The reversal of 1000000055557 is 7555500000001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 980444550276 + 19555505281 = 990174^2 + 139841^2 .

It is a cyclic number.

It is not a de Polignac number, because 1000000055557 - 27 = 1000000055429 is a prime.

It is a super-2 number, since 2×10000000555572 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 21000000055557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4375, while the sum is 28.

Adding to 1000000055557 its reverse (7555500000001), we get a palindrome (8555500055558).

The spelling of 1000000055557 in words is "one trillion, fifty-five thousand, five hundred fifty-seven".