Search a number
-
+
101013440330137 is a prime number
BaseRepresentation
bin10110111101111100000110…
…001110100111100110011001
3111020122210100100002110121211
4112331330012032213212121
5101220001011211031022
6554500533414103121
730163660134622246
oct2675740616474631
9436583310073554
10101013440330137
112a205617719025
12b3b50b894aaa1
1344496acaa594a
141ad31102865cd
15ba28d0e65e77
hex5bdf063a7999

101013440330137 has 2 divisors, whose sum is σ = 101013440330138. Its totient is φ = 101013440330136.

The previous prime is 101013440329951. The next prime is 101013440330147. The reversal of 101013440330137 is 731033044310101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64871893467481 + 36141546862656 = 8054309^2 + 6011784^2 .

It is a cyclic number.

It is not a de Polignac number, because 101013440330137 - 235 = 100979080591769 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 101013440330099 and 101013440330108.

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

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

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

Almost surely, 2101013440330137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9072, while the sum is 31.

Adding to 101013440330137 its reverse (731033044310101), we get a palindrome (832046484640238).

The spelling of 101013440330137 in words is "one hundred one trillion, thirteen billion, four hundred forty million, three hundred thirty thousand, one hundred thirty-seven".