Search a number
-
+
101030662013 is a prime number
BaseRepresentation
bin101111000010111100…
…1011000111101111101
3100122210000000101201212
41132011321120331331
53123402322141023
6114225101414205
710204430313011
oct1360571307575
9318700011655
10101030662013
11399351a1796
12176b6b6a365
1396b11c4018
144c65cb0541
152964975e78
hex1785e58f7d

101030662013 has 2 divisors, whose sum is σ = 101030662014. Its totient is φ = 101030662012.

The previous prime is 101030661943. The next prime is 101030662067. The reversal of 101030662013 is 310266030101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92938400164 + 8092261849 = 304858^2 + 89957^2 .

It is a cyclic number.

It is not a de Polignac number, because 101030662013 - 228 = 100762226557 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2101030662013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 23.

Adding to 101030662013 its reverse (310266030101), we get a palindrome (411296692114).

The spelling of 101030662013 in words is "one hundred one billion, thirty million, six hundred sixty-two thousand, thirteen".