Search a number
-
+
106753010327511 = 3315831126692739
BaseRepresentation
bin11000010001011101011111…
…010000100101111111010111
3111222222111011211122010120020
4120101131133100211333113
5102443020131120440021
61015013353402240223
731325436053630652
oct3021353720457727
9458874154563506
10106753010327511
1131018774314949
12bb815471b6073
1347749c5271872
141c50c3236a899
15c51d565d87c6
hex61175f425fd7

106753010327511 has 8 divisors (see below), whose sum is σ = 142341854000640. Its totient is φ = 71166420103032.

The previous prime is 106753010327503. The next prime is 106753010327521. The reversal of 106753010327511 is 115723010357601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 106753010327511 - 23 = 106753010327503 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (106753010327521) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 563251621 + ... + 563441118.

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

Almost surely, 2106753010327511 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1126724325.

The product of its (nonzero) digits is 132300, while the sum is 42.

The spelling of 106753010327511 in words is "one hundred six trillion, seven hundred fifty-three billion, ten million, three hundred twenty-seven thousand, five hundred eleven".

Divisors: 1 3 31583 94749 1126692739 3380078217 35584336775837 106753010327511