Base | Representation |
---|---|
bin | 11000010000000011001010… |
… | …000001000100001000111000 |
3 | 111222122012211012220021011012 |
4 | 120100003022001010020320 |
5 | 102434423010343433000 |
6 | 1014501033050253052 |
7 | 31315433350460003 |
oct | 3020031201041070 |
9 | 458565735807135 |
10 | 106656017171000 |
11 | 30a906211a3870 |
12 | bb66798427188 |
13 | 47688086a156b |
14 | 1c4a2707b453a |
15 | c4e57b345735 |
hex | 6100ca044238 |
106656017171000 has 128 divisors (see below), whose sum is σ = 288279237504960. Its totient is φ = 36502594048000.
The previous prime is 106656017170999. The next prime is 106656017171009. The reversal of 106656017171000 is 171710656601.
It is a super-2 number, since 2×1066560171710002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106656017171009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 284989517 + ... + 285363516.
Almost surely, 2106656017171000 is an apocalyptic number.
106656017171000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106656017171000 is an abundant number, since it is smaller than the sum of its proper divisors (181623220333960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106656017171000 is a wasteful number, since it uses less digits than its factorization.
106656017171000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570353082 (or 570353068 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 41.
The spelling of 106656017171000 in words is "one hundred six trillion, six hundred fifty-six billion, seventeen million, one hundred seventy-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •