Search a number
-
+
10103331133069 is a prime number
BaseRepresentation
bin1001001100000101110101…
…1101101001011010001101
31022202212110111222200120221
42103001131131221122031
52311013110232224234
633253223425511341
72061640651443106
oct223013535513215
938685414880527
1010103331133069
113245887038759
1211721151a2551
13583980b2ac05
1426d00a7513ad
15127c2682eeb4
hex9305d76968d

10103331133069 has 2 divisors, whose sum is σ = 10103331133070. Its totient is φ = 10103331133068.

The previous prime is 10103331132991. The next prime is 10103331133073. The reversal of 10103331133069 is 96033113330101.

10103331133069 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., 7783329979044 + 2320001154025 = 2789862^2 + 1523155^2 .

It is a cyclic number.

It is not a de Polignac number, because 10103331133069 - 211 = 10103331131021 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 210103331133069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13122, while the sum is 34.

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