Search a number
-
+
106413224501 is a prime number
BaseRepresentation
bin110001100011010111…
…0001111001000110101
3101011200010020220101002
41203012232033020311
53220413241141001
6120515140413045
710455006325013
oct1430656171065
9334603226332
10106413224501
1141147544641
12187596a7185
13a05b39a23c
145216ab78b3
152b7c29946b
hex18c6b8f235

106413224501 has 2 divisors, whose sum is σ = 106413224502. Its totient is φ = 106413224500.

The previous prime is 106413224471. The next prime is 106413224507. The reversal of 106413224501 is 105422314601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94909589476 + 11503635025 = 308074^2 + 107255^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-106413224501 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2106413224501 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 106413224501 in words is "one hundred six billion, four hundred thirteen million, two hundred twenty-four thousand, five hundred one".