Search a number
-
+
10676346101 is a prime number
BaseRepresentation
bin10011111000101110…
…00001110011110101
31000120001102120112222
421330113001303311
5133331121033401
64523223052125
7525366305321
oct117427016365
930501376488
1010676346101
114589578933
12209b5a1045
131011b67275
14733d00981
1542745bc1b
hex27c5c1cf5

10676346101 has 2 divisors, whose sum is σ = 10676346102. Its totient is φ = 10676346100.

The previous prime is 10676346089. The next prime is 10676346113. The reversal of 10676346101 is 10164367601.

It is a balanced prime because it is at equal distance from previous prime (10676346089) and next prime (10676346113).

It can be written as a sum of positive squares in only one way, i.e., 9814864900 + 861481201 = 99070^2 + 29351^2 .

It is an emirp because it is prime and its reverse (10164367601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10676346101 - 222 = 10672151797 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210676346101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18144, while the sum is 35.

The spelling of 10676346101 in words is "ten billion, six hundred seventy-six million, three hundred forty-six thousand, one hundred one".