Search a number
-
+
106410105551 = 711498733881
BaseRepresentation
bin110001100011010001…
…0010101101011001111
3101011122220101102222102
41203012202111223033
53220411441334201
6120514545505315
710454640654611
oct1430642255317
9334586342872
10106410105551
11411458042a2
121875864223b
13a05a8476c9
145216504db1
152b7bd8026b
hex18c6895acf

106410105551 has 4 divisors (see below), whose sum is σ = 107908839504. Its totient is φ = 104911371600.

The previous prime is 106410105539. The next prime is 106410105601. The reversal of 106410105551 is 155501014601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 106410105551 - 222 = 106405911247 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (106410105251) 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 in 3 ways as a sum of consecutive naturals, for example, 749366870 + ... + 749367011.

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

Almost surely, 2106410105551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1498733952.

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

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

Divisors: 1 71 1498733881 106410105551