Search a number
-
+
101001100101037 is a prime number
BaseRepresentation
bin10110111101110000100110…
…101100011000010110101101
3111020121121111022202212200121
4112331300212230120112231
5101214300223111213122
6554451133112124541
730163042262455033
oct2675604654302655
9436547438685617
10101001100101037
112a200364a06284
12b3b2834096751
1344484942c9436
141ad269d3c2553
15ba240c8dbbc7
hex5bdc26b185ad

101001100101037 has 2 divisors, whose sum is σ = 101001100101038. Its totient is φ = 101001100101036.

The previous prime is 101001100100983. The next prime is 101001100101113. The reversal of 101001100101037 is 730101001100101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93895111622601 + 7105988478436 = 9689949^2 + 2665706^2 .

It is a cyclic number.

It is not a de Polignac number, because 101001100101037 - 235 = 100966740362669 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101001100101037.

It is a congruent number.

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

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

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

Almost surely, 2101001100101037 is an apocalyptic number.

It is an amenable number.

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

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

101001100101037 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 101001100101037 its reverse (730101001100101), we get a palindrome (831102101201138).

The spelling of 101001100101037 in words is "one hundred one trillion, one billion, one hundred million, one hundred one thousand, thirty-seven".