Base | Representation |
---|---|
bin | 110001101110001100… |
… | …1001011100111001000 |
3 | 101012121110101122101110 |
4 | 1203130121023213020 |
5 | 3222134330210114 |
6 | 121015205250320 |
7 | 10500012566640 |
oct | 1433431134710 |
9 | 335543348343 |
10 | 106776803784 |
11 | 413137a4092 |
12 | 1883b4039a0 |
13 | a0b87c9201 |
14 | 524d0bb520 |
15 | 2b9e166759 |
hex | 18dc64b9c8 |
106776803784 has 128 divisors (see below), whose sum is σ = 307313879040. Its totient is φ = 30284623872.
The previous prime is 106776803773. The next prime is 106776803797. The reversal of 106776803784 is 487308677601.
It is a super-2 number, since 2×1067768037842 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16305999 + ... + 16312545.
It is an arithmetic number, because the mean of its divisors is an integer number (2400889680).
Almost surely, 2106776803784 is an apocalyptic number.
106776803784 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106776803784, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153656939520).
106776803784 is an abundant number, since it is smaller than the sum of its proper divisors (200537075256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106776803784 is a wasteful number, since it uses less digits than its factorization.
106776803784 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7259 (or 7255 counting only the distinct ones).
The product of its (nonzero) digits is 9483264, while the sum is 57.
The spelling of 106776803784 in words is "one hundred six billion, seven hundred seventy-six million, eight hundred three thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •