Search a number
-
+
101001111000037 is a prime number
BaseRepresentation
bin10110111101110000100111…
…010101111101001111100101
3111020121121112002021121022021
4112331300213111331033211
5101214300233404000122
6554451134141503141
730163042454220403
oct2675604725751745
9436547462247267
10101001111000037
112a20037007a916
12b3b2837871ab1
134448496644251
141ad26a0a1c473
15ba240d8411c7
hex5bdc2757d3e5

101001111000037 has 2 divisors, whose sum is σ = 101001111000038. Its totient is φ = 101001111000036.

The previous prime is 101001110999939. The next prime is 101001111000079. The reversal of 101001111000037 is 730000111100101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64919777112961 + 36081333887076 = 8057281^2 + 6006774^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2101001111000037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21, while the sum is 16.

Adding to 101001111000037 its reverse (730000111100101), we get a palindrome (831001222100138).

The spelling of 101001111000037 in words is "one hundred one trillion, one billion, one hundred eleven million, thirty-seven", and thus it is an aban number.