Base | Representation |
---|---|
bin | 110001101111000000… |
… | …0000011101100011100 |
3 | 101012200100010210002020 |
4 | 1203132000003230130 |
5 | 3222213231202223 |
6 | 121022011300140 |
7 | 10500461041011 |
oct | 1433600035434 |
9 | 335610123066 |
10 | 106803772188 |
11 | 41327a43923 |
12 | 1884844a650 |
13 | a0c127c349 |
14 | 52528db708 |
15 | 2ba16e21e3 |
hex | 18de003b1c |
106803772188 has 48 divisors (see below), whose sum is σ = 252624199296. Its totient is φ = 35114748480.
The previous prime is 106803772183. The next prime is 106803772199. The reversal of 106803772188 is 881277308601.
It is a super-2 number, since 2×1068037721882 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 106803772188.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106803772183) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 523083 + ... + 698013.
It is an arithmetic number, because the mean of its divisors is an integer number (5263004152).
Almost surely, 2106803772188 is an apocalyptic number.
It is an amenable number.
106803772188 is an abundant number, since it is smaller than the sum of its proper divisors (145820427108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106803772188 is a wasteful number, since it uses less digits than its factorization.
106803772188 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175634 (or 175632 counting only the distinct ones).
The product of its (nonzero) digits is 903168, while the sum is 51.
The spelling of 106803772188 in words is "one hundred six billion, eight hundred three million, seven hundred seventy-two thousand, one hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •