Search a number
-
+
1058096686561 is a prime number
BaseRepresentation
bin11110110010110110111…
…10100010010111100001
310202011010120120220000221
433121123132202113201
5114313440222432221
62130025524043041
7136305423303655
oct17313336422741
93664116526027
101058096686561
11378810aa4442
12151096533481
1378a16601c55
14392d820ca65
151c7cbd54541
hexf65b7a25e1

1058096686561 has 2 divisors, whose sum is σ = 1058096686562. Its totient is φ = 1058096686560.

The previous prime is 1058096686513. The next prime is 1058096686649. The reversal of 1058096686561 is 1656866908501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 620401974336 + 437694712225 = 787656^2 + 661585^2 .

It is a cyclic number.

It is not a de Polignac number, because 1058096686561 - 229 = 1057559815649 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1058096686561.

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

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

Almost surely, 21058096686561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18662400, while the sum is 61.

The spelling of 1058096686561 in words is "one trillion, fifty-eight billion, ninety-six million, six hundred eighty-six thousand, five hundred sixty-one".