Search a number
-
+
101003032012009 is a prime number
BaseRepresentation
bin10110111101110010011001…
…110110000010010011101001
3111020121210110222000010022211
4112331302121312002103221
5101214313202143341014
6554452052523445121
730163141201442401
oct2675623166022351
9436553428003284
10101003032012009
112a201166477616
12b3b30930867a1
134448711623a1a
141ad2803bd5801
15ba24c22eecc4
hex5bdc99d824e9

101003032012009 has 2 divisors, whose sum is σ = 101003032012010. Its totient is φ = 101003032012008.

The previous prime is 101003032011979. The next prime is 101003032012027. The reversal of 101003032012009 is 900210230300101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73348895973609 + 27654136038400 = 8564397^2 + 5258720^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2101003032012009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 324, while the sum is 22.

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