Search a number
-
+
101120070069049 is a prime number
BaseRepresentation
bin10110111111011111011001…
…110110110010101100111001
3111021000222120112202102221011
4112333133121312302230321
5101223222400414202144
6555021530251313521
730204453413505523
oct2677373166625471
9437028515672834
10101120070069049
112a2468653a5099
12b4118b6a4b8a1
134456773c8cc05
141ad8347a00a13
15ba557222ca34
hex5bf7d9db2b39

101120070069049 has 2 divisors, whose sum is σ = 101120070069050. Its totient is φ = 101120070069048.

The previous prime is 101120070068989. The next prime is 101120070069089. The reversal of 101120070069049 is 940960070021101.

It is an a-pointer prime, because the next prime (101120070069089) can be obtained adding 101120070069049 to its sum of digits (40).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99695592013824 + 1424478055225 = 9984768^2 + 1193515^2 .

It is a cyclic number.

It is not a de Polignac number, because 101120070069049 - 211 = 101120070067001 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 2101120070069049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27216, while the sum is 40.

The spelling of 101120070069049 in words is "one hundred one trillion, one hundred twenty billion, seventy million, sixty-nine thousand, forty-nine".