Base | Representation |
---|---|
bin | 110001110001011000… |
… | …0001110100111000000 |
3 | 101012212220011210222100 |
4 | 1203202300032213000 |
5 | 3222344134234142 |
6 | 121033540310400 |
7 | 10502446555623 |
oct | 1434260164700 |
9 | 335786153870 |
10 | 106883508672 |
11 | 41368a55046 |
12 | 1886b0a2400 |
13 | a1049497b5 |
14 | 525d335dba |
15 | 2ba86e2b4c |
hex | 18e2c0e9c0 |
106883508672 has 168 divisors, whose sum is σ = 327418421616. Its totient is φ = 33218371584.
The previous prime is 106883508629. The next prime is 106883508703. The reversal of 106883508672 is 276805388601.
106883508672 is a `hidden beast` number, since 1 + 0 + 68 + 8 + 3 + 508 + 6 + 72 = 666.
It is a super-2 number, since 2×1068835086722 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 996738 + ... + 1098750.
Almost surely, 2106883508672 is an apocalyptic number.
106883508672 is a gapful number since it is divisible by the number (12) 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 106883508672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163709210808).
106883508672 is an abundant number, since it is smaller than the sum of its proper divisors (220534912944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106883508672 is a wasteful number, since it uses less digits than its factorization.
106883508672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102155 (or 102142 counting only the distinct ones).
The product of its (nonzero) digits is 3870720, while the sum is 54.
The spelling of 106883508672 in words is "one hundred six billion, eight hundred eighty-three million, five hundred eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •