Search a number
-
+
106110015175 = 524244400607
BaseRepresentation
bin110001011010010100…
…1100101011011000111
3101010212222201021101001
41202310221211123013
53214303130441200
6120425105514131
710444335150553
oct1426451453307
9333788637331
10106110015175
1141001378a1a
1218694042947
13a010617738
1451c870a863
152b6085476a
hex18b4a656c7

106110015175 has 6 divisors (see below), whose sum is σ = 131576418848. Its totient is φ = 84888012120.

The previous prime is 106110015127. The next prime is 106110015203. The reversal of 106110015175 is 571510011601.

It is not a de Polignac number, because 106110015175 - 29 = 106110014663 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 2122200279 + ... + 2122200328.

Almost surely, 2106110015175 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4244400617 (or 4244400612 counting only the distinct ones).

The product of its (nonzero) digits is 1050, while the sum is 28.

Adding to 106110015175 its reverse (571510011601), we get a palindrome (677620026776).

The spelling of 106110015175 in words is "one hundred six billion, one hundred ten million, fifteen thousand, one hundred seventy-five".

Divisors: 1 5 25 4244400607 21222003035 106110015175