Search a number
-
+
1050330103169 is a prime number
BaseRepresentation
bin11110100100011001000…
…11010111110110000001
310201102002022101120112012
433102030203113312001
5114202034001300134
62122303123142305
7135612105366464
oct17221443276601
93642068346465
101050330103169
11375495a63386
1214b689514995
1378079546289
1438b9c9452db
151c4c50b46ce
hexf48c8d7d81

1050330103169 has 2 divisors, whose sum is σ = 1050330103170. Its totient is φ = 1050330103168.

The previous prime is 1050330103091. The next prime is 1050330103181. The reversal of 1050330103169 is 9613010330501.

1050330103169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 573180725569 + 477149377600 = 757087^2 + 690760^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 21050330103169 is an apocalyptic number.

It is an amenable number.

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

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

1050330103169 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 7290, while the sum is 32.

The spelling of 1050330103169 in words is "one trillion, fifty billion, three hundred thirty million, one hundred three thousand, one hundred sixty-nine".