Search a number
-
+
10556055600061 is a prime number
BaseRepresentation
bin1001100110011100010111…
…1100011011101110111101
31101101011000122221111022111
42121213011330123232331
52340422300213200221
634241215054214021
72136435620065246
oct231470574335675
941334018844274
1010556055600061
1133aa886210514
121225a017b4311
135b757c7ab0ca
14286cb7005ccd
151348c1d87be1
hex999c5f1bbbd

10556055600061 has 2 divisors, whose sum is σ = 10556055600062. Its totient is φ = 10556055600060.

The previous prime is 10556055600043. The next prime is 10556055600089. The reversal of 10556055600061 is 16000655065501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10521135576900 + 34920023161 = 3243630^2 + 186869^2 .

It is a cyclic number.

It is not a de Polignac number, because 10556055600061 - 27 = 10556055599933 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 210556055600061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 135000, while the sum is 40.

The spelling of 10556055600061 in words is "ten trillion, five hundred fifty-six billion, fifty-five million, six hundred thousand, sixty-one".