Search a number
-
+
10600055510927 is a prime number
BaseRepresentation
bin1001101001000000010010…
…0010110001011110001111
31101112100121002112112222212
42122100010202301132033
52342132403202322202
634313333121101035
72142554154131621
oct232200442613617
941470532475885
1010600055510927
113417504aa1813
12123244118777b
135bb77245061c
1428908c902c11
15135ae9ac8652
hex9a4048b178f

10600055510927 has 2 divisors, whose sum is σ = 10600055510928. Its totient is φ = 10600055510926.

The previous prime is 10600055510923. The next prime is 10600055511011. The reversal of 10600055510927 is 72901555000601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10600055510927 - 22 = 10600055510923 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210600055510927 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 94500, while the sum is 41.

The spelling of 10600055510927 in words is "ten trillion, six hundred billion, fifty-five million, five hundred ten thousand, nine hundred twenty-seven".