Search a number
-
+
105654106141 is a prime number
BaseRepresentation
bin110001001100101111…
…0011011100000011101
3101002201012211200202021
41202121132123200131
53212334422344031
6120311542100141
710430131040653
oct1423136334035
9332635750667
10105654106141
1140897a967a1
121858741a651
139c6a02c28c
145183d50dd3
152b357ea511
hex189979b81d

105654106141 has 2 divisors, whose sum is σ = 105654106142. Its totient is φ = 105654106140.

The previous prime is 105654106127. The next prime is 105654106183. The reversal of 105654106141 is 141601456501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 68772440025 + 36881666116 = 262245^2 + 192046^2 .

It is a cyclic number.

It is not a de Polignac number, because 105654106141 - 215 = 105654073373 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2105654106141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14400, while the sum is 34.

The spelling of 105654106141 in words is "one hundred five billion, six hundred fifty-four million, one hundred six thousand, one hundred forty-one".