Base | Representation |
---|---|
bin | 11000001110100110011111… |
… | …010110110010001001001000 |
3 | 111222021200222220010211202021 |
4 | 120032212133112302021020 |
5 | 102431310221400240420 |
6 | 1014343215504414224 |
7 | 31305311554602250 |
oct | 3016463726621110 |
9 | 458250886124667 |
10 | 106556517196360 |
11 | 30a52402042170 |
12 | bb4b44a017374 |
13 | 475c30c65561a |
14 | 1c45511d14960 |
15 | c4bba5e7b7aa |
hex | 60e99f5b2248 |
106556517196360 has 128 divisors (see below), whose sum is σ = 303811982288640. Its totient is φ = 32667954969600.
The previous prime is 106556517196301. The next prime is 106556517196411. The reversal of 106556517196360 is 63691715655601.
It is a super-2 number, since 2×1065565171963602 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (61).
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, 283388119 + ... + 283763878.
It is an arithmetic number, because the mean of its divisors is an integer number (2373531111630).
Almost surely, 2106556517196360 is an apocalyptic number.
106556517196360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106556517196360 is an abundant number, since it is smaller than the sum of its proper divisors (197255465092280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106556517196360 is a wasteful number, since it uses less digits than its factorization.
106556517196360 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 567152087 (or 567152083 counting only the distinct ones).
The product of its (nonzero) digits is 30618000, while the sum is 61.
The spelling of 106556517196360 in words is "one hundred six trillion, five hundred fifty-six billion, five hundred seventeen million, one hundred ninety-six thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •