Search a number
-
+
106413681953 is a prime number
BaseRepresentation
bin110001100011010111…
…1111110110100100001
3101011200011010010212202
41203012233332310201
53220413400310303
6120515154302545
710455013241465
oct1430657766441
9334604103782
10106413681953
11411478272a7
1218759887a55
13a05b4ca517
145216b964a5
152b7c339c88
hex18c6bfed21

106413681953 has 2 divisors, whose sum is σ = 106413681954. Its totient is φ = 106413681952.

The previous prime is 106413681943. The next prime is 106413682049. The reversal of 106413681953 is 359186314601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 68344599184 + 38069082769 = 261428^2 + 195113^2 .

It is a cyclic number.

It is not a de Polignac number, because 106413681953 - 214 = 106413665569 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 106413681898 and 106413681907.

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

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

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

Almost surely, 2106413681953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 466560, while the sum is 47.

The spelling of 106413681953 in words is "one hundred six billion, four hundred thirteen million, six hundred eighty-one thousand, nine hundred fifty-three".