Search a number
-
+
1050060056027 is a prime number
BaseRepresentation
bin11110100011111000111…
…01001110010111011011
310201101101111020202111012
433101330131032113123
5114201010333243102
62122220235124135
7135602316131153
oct17217435162733
93641344222435
101050060056027
11375367587a24
1214b612ba364b
1378035604b78
1438b74b2b763
151c4ab520752
hexf47c74e5db

1050060056027 has 2 divisors, whose sum is σ = 1050060056028. Its totient is φ = 1050060056026.

The previous prime is 1050060056009. The next prime is 1050060056033. The reversal of 1050060056027 is 7206500600501.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (7206500600501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1050060056027 - 210 = 1050060055003 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1050060055984 and 1050060056002.

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

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

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

Almost surely, 21050060056027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12600, while the sum is 32.

Adding to 1050060056027 its reverse (7206500600501), we get a palindrome (8256560656528).

The spelling of 1050060056027 in words is "one trillion, fifty billion, sixty million, fifty-six thousand, twenty-seven".