Search a number
-
+
10056011055089 is a prime number
BaseRepresentation
bin1001001001010101100011…
…1101110111111111110001
31022121100022200220122212012
42102111120331313333301
52304224202312230324
633215400120212305
72055344220431066
oct222253075677761
938540280818765
1010056011055089
11322780409879a
121164b0990a095
1357c37c364b7c
1426a9dbd08c6d
151268a73a620e
hex92558f77ff1

10056011055089 has 2 divisors, whose sum is σ = 10056011055090. Its totient is φ = 10056011055088.

The previous prime is 10056011055049. The next prime is 10056011055091. The reversal of 10056011055089 is 98055011065001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9100074656689 + 955936398400 = 3016633^2 + 977720^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10056011055089 is a prime.

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

Together with 10056011055091, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 210056011055089 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10056011055089 in words is "ten trillion, fifty-six billion, eleven million, fifty-five thousand, eighty-nine".