Search a number
-
+
103796211791201 is a prime number
BaseRepresentation
bin10111100110011011110000…
…010101010011010101100001
3111121111211011110112121011212
4113212123300111103111201
5102101044120204304301
61004431153232115505
730602012614022006
oct2746336025232541
9447454143477155
10103796211791201
11300887a965a276
12b784499395b95
1345bbc2cb56037
141b8ba98ccb8ad
15beee9e9684bb
hex5e66f0553561

103796211791201 has 2 divisors, whose sum is σ = 103796211791202. Its totient is φ = 103796211791200.

The previous prime is 103796211791197. The next prime is 103796211791203. The reversal of 103796211791201 is 102197112697301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 90233755731025 + 13562456060176 = 9499145^2 + 3682724^2 .

It is a cyclic number.

It is not a de Polignac number, because 103796211791201 - 22 = 103796211791197 is a prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 2103796211791201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 285768, while the sum is 50.

The spelling of 103796211791201 in words is "one hundred three trillion, seven hundred ninety-six billion, two hundred eleven million, seven hundred ninety-one thousand, two hundred one".