Search a number
-
+
101313397 is a prime number
BaseRepresentation
bin1100000100111…
…10101101110101
321001122020212001
412002132231311
5201414012042
614015255301
72340102223
oct602365565
9231566761
10101313397
1152209289
1229b1a531
1317cb3573
14d653b13
158d63bb7
hex609eb75

101313397 has 2 divisors, whose sum is σ = 101313398. Its totient is φ = 101313396.

The previous prime is 101313391. The next prime is 101313409. The reversal of 101313397 is 793313101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 80892036 + 20421361 = 8994^2 + 4519^2 .

It is a cyclic number.

It is not a de Polignac number, because 101313397 - 211 = 101311349 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2101313397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1701, while the sum is 28.

The square root of 101313397 is about 10065.4556280379. The cubic root of 101313397 is about 466.1821342234.

Adding to 101313397 its reverse (793313101), we get a palindrome (894626498).

The spelling of 101313397 in words is "one hundred one million, three hundred thirteen thousand, three hundred ninety-seven".