Search a number
-
+
101030223040009 is a prime number
BaseRepresentation
bin10110111110001011101110…
…100011100100111000001001
3111020201101122221201110111221
4112332023232203210320021
5101220234344044240014
6554512351013522041
730165123052404454
oct2676135643447011
9436641587643457
10101030223040009
112a21174a06538a
12b3b8401343321
13444b155a69bc3
141ad3c6316249b
15ba306451ab24
hex5be2ee8e4e09

101030223040009 has 2 divisors, whose sum is σ = 101030223040010. Its totient is φ = 101030223040008.

The previous prime is 101030223039937. The next prime is 101030223040037. The reversal of 101030223040009 is 900040322030101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 75853160634384 + 25177062405625 = 8709372^2 + 5017675^2 .

It is a cyclic number.

It is not a de Polignac number, because 101030223040009 - 27 = 101030223039881 is a prime.

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

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

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

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

Almost surely, 2101030223040009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 25.

The spelling of 101030223040009 in words is "one hundred one trillion, thirty billion, two hundred twenty-three million, forty thousand, nine".