Search a number
-
+
106037326806 = 2317672887801
BaseRepresentation
bin110001011000001010…
…0010011001111010110
3101010200220221022200020
41202300110103033112
53214131023424211
6120413551530010
710442463256245
oct1426024231726
9333626838606
10106037326806
1140a74341094
1218673829906
139ccb547378
1451bcbc895c
152b59297306
hex18b05133d6

106037326806 has 8 divisors (see below), whose sum is σ = 212074653624. Its totient is φ = 35345775600.

The previous prime is 106037326751. The next prime is 106037326807. The reversal of 106037326806 is 608623730601.

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

106037326806 is an admirable number.

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

It is a Curzon number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8836443895 + ... + 8836443906.

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

Almost surely, 2106037326806 is an apocalyptic number.

106037326806 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 17672887806.

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

The spelling of 106037326806 in words is "one hundred six billion, thirty-seven million, three hundred twenty-six thousand, eight hundred six".

Divisors: 1 2 3 6 17672887801 35345775602 53018663403 106037326806