Search a number
-
+
1060485081037 is a prime number
BaseRepresentation
bin11110110111010011101…
…01100010011111001101
310202101022000202220022121
433123221311202133031
5114333333140043122
62131102523412541
7136421544313114
oct17335165423715
93671260686277
101060485081037
113798271aa578
12151642384151
1379007386315
14394834cac7b
151c8bb886bc7
hexf6e9d627cd

1060485081037 has 2 divisors, whose sum is σ = 1060485081038. Its totient is φ = 1060485081036.

The previous prime is 1060485081017. The next prime is 1060485081049. The reversal of 1060485081037 is 7301805840601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 976086696841 + 84398384196 = 987971^2 + 290514^2 .

It is a cyclic number.

It is not a de Polignac number, because 1060485081037 - 227 = 1060350863309 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21060485081037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 161280, while the sum is 43.

The spelling of 1060485081037 in words is "one trillion, sixty billion, four hundred eighty-five million, eighty-one thousand, thirty-seven".