Search a number
-
+
106352601401 is a prime number
BaseRepresentation
bin110001100001100011…
…0111110100100111001
3101011111220011221010002
41203003012332210321
53220302231221101
6120505133202345
710453342124204
oct1430306764471
9334456157102
10106352601401
11411162a8602
12187413303b5
13a04b962797
14520ca1693b
152b76cc1d6b
hex18c31be939

106352601401 has 2 divisors, whose sum is σ = 106352601402. Its totient is φ = 106352601400.

The previous prime is 106352601301. The next prime is 106352601413. The reversal of 106352601401 is 104106253601.

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., 101222604025 + 5129997376 = 318155^2 + 71624^2 .

It is a cyclic number.

It is not a de Polignac number, because 106352601401 - 222 = 106348407097 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (106352601301) 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, 53176300700 + 53176300701.

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

Almost surely, 2106352601401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4320, while the sum is 29.

The spelling of 106352601401 in words is "one hundred six billion, three hundred fifty-two million, six hundred one thousand, four hundred one".