Base | Representation |
---|---|
bin | 110001101110001110… |
… | …1110011100111000000 |
3 | 101012121112200020111110 |
4 | 1203130131303213000 |
5 | 3222140133004232 |
6 | 121015251243320 |
7 | 10500026106441 |
oct | 1433435634700 |
9 | 335545606443 |
10 | 106778016192 |
11 | 41314451a81 |
12 | 1883b8a9540 |
13 | a0b8b32003 |
14 | 524d3152c8 |
15 | 2b9e305acc |
hex | 18dc7739c0 |
106778016192 has 56 divisors (see below), whose sum is σ = 299135480976. Its totient is φ = 33498984448.
The previous prime is 106778016157. The next prime is 106778016251. The reversal of 106778016192 is 291610877601.
It is a super-2 number, since 2×1067780161922 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 16353663 + ... + 16360190.
Almost surely, 2106778016192 is an apocalyptic number.
106778016192 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106778016192 is an abundant number, since it is smaller than the sum of its proper divisors (192357464784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106778016192 is a wasteful number, since it uses less digits than its factorization.
106778016192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32713885 (or 32713875 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 48.
The spelling of 106778016192 in words is "one hundred six billion, seven hundred seventy-eight million, sixteen thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •