Search a number
-
+
106010113568 = 253312816049
BaseRepresentation
bin110001010111010110…
…0011111011000100000
3101010122000201202010112
41202232230133120200
53214102042113233
6120411140350452
710442013045332
oct1425654373040
9333560652115
10106010113568
1140a5aa44407
12186666a5428
139cc5a09968
1451b9343452
152b56bbe048
hex18aeb1f620

106010113568 has 12 divisors (see below), whose sum is σ = 208707411150. Its totient is φ = 53005056768.

The previous prime is 106010113529. The next prime is 106010113571. The reversal of 106010113568 is 865311010601.

It can be written as a sum of positive squares in only one way, i.e., 101106192784 + 4903920784 = 317972^2 + 70028^2 .

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

It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 3312816049 = 106010113568 / (1 + 0 + 6 + 0 + 1 + 0 + 1 + 1 + 3 + 5 + 6 + 8).

It is an unprimeable number.

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

Almost surely, 2106010113568 is an apocalyptic number.

It is an amenable number.

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

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

106010113568 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 106010113568 in words is "one hundred six billion, ten million, one hundred thirteen thousand, five hundred sixty-eight".

Divisors: 1 2 4 8 16 32 3312816049 6625632098 13251264196 26502528392 53005056784 106010113568