Search a number
-
+
1055502125401 is a prime number
BaseRepresentation
bin11110101110000001101…
…01000100100101011001
310201220102202110112020011
433113000311010211121
5114243132021003101
62124520241401521
7136154220014503
oct17270065044531
93656382415204
101055502125401
113776aa484219
121506916392a1
13786c1c14769
143912d7c4d73
151c6c919a751
hexf5c0d44959

1055502125401 has 2 divisors, whose sum is σ = 1055502125402. Its totient is φ = 1055502125400.

The previous prime is 1055502125317. The next prime is 1055502125437. The reversal of 1055502125401 is 1045212055501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1051648199001 + 3853926400 = 1025499^2 + 62080^2 .

It is a cyclic number.

It is not a de Polignac number, because 1055502125401 - 233 = 1046912190809 is a prime.

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

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

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

Almost surely, 21055502125401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10000, while the sum is 31.

The spelling of 1055502125401 in words is "one trillion, fifty-five billion, five hundred two million, one hundred twenty-five thousand, four hundred one".