Search a number
-
+
1061110550497 is a prime number
BaseRepresentation
bin11110111000011110001…
…11100000111111100001
310202102220121201001010011
433130033013200333201
5114341123300103442
62131244545404521
7136443210601204
oct17341707407741
93672817631104
101061110550497
1137a018273a88
12151797939741
13790a6b2b9aa
14395025c393b
151c906736117
hexf70f1e0fe1

1061110550497 has 2 divisors, whose sum is σ = 1061110550498. Its totient is φ = 1061110550496.

The previous prime is 1061110550483. The next prime is 1061110550557. The reversal of 1061110550497 is 7940550111601.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 935313357456 + 125797193041 = 967116^2 + 354679^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1061110550497 - 27 = 1061110550369 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21061110550497 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1061110550497 in words is "one trillion, sixty-one billion, one hundred ten million, five hundred fifty thousand, four hundred ninety-seven".