Search a number
-
+
106010556035 = 5296710912049
BaseRepresentation
bin110001010111010111…
…0001011011010000011
3101010122001120020002012
41202232232023122003
53214102200243120
6120411154043135
710442016600326
oct1425656133203
9333561506065
10106010556035
1140a6021688a
12186668794ab
139cc5b33187
1451b941a7bd
152b56c5a1c5
hex18aeb8b683

106010556035 has 16 divisors (see below), whose sum is σ = 133563492000. Its totient is φ = 80661858816.

The previous prime is 106010556019. The next prime is 106010556049. The reversal of 106010556035 is 530655010601.

It is a cyclic number.

It is not a de Polignac number, because 106010556035 - 24 = 106010556019 is a prime.

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

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

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 15 ways as a sum of consecutive naturals, for example, 5446310 + ... + 5465739.

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

Almost surely, 2106010556035 is an apocalyptic number.

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

106010556035 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 10912150.

The product of its (nonzero) digits is 13500, while the sum is 32.

Adding to 106010556035 its reverse (530655010601), we get a palindrome (636665566636).

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

Divisors: 1 5 29 67 145 335 1943 9715 10912049 54560245 316449421 731107283 1582247105 3655536415 21202111207 106010556035