Base | Representation |
---|---|
bin | 11000001110010110000000… |
… | …100011001001001110111000 |
3 | 111222020000022120122012010210 |
4 | 120032112000203021032320 |
5 | 102431013001020130114 |
6 | 1014331131454311120 |
7 | 31304114201130006 |
oct | 3016260043111670 |
9 | 458200276565123 |
10 | 106538820473784 |
11 | 30a45950772606 |
12 | bb47b2b4b84a0 |
13 | 475a74c1cc84a |
14 | 1c447138b1a76 |
15 | c4b4bc52d259 |
hex | 60e5808c93b8 |
106538820473784 has 32 divisors (see below), whose sum is σ = 268932944891520. Its totient is φ = 35168154330336.
The previous prime is 106538820473759. The next prime is 106538820473807. The reversal of 106538820473784 is 487374028835601.
It is a super-3 number, since 3×1065388204737843 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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, 21549111702 + ... + 21549116645.
It is an arithmetic number, because the mean of its divisors is an integer number (8404154527860).
Almost surely, 2106538820473784 is an apocalyptic number.
It is an amenable number.
106538820473784 is an abundant number, since it is smaller than the sum of its proper divisors (162394124417736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106538820473784 is a wasteful number, since it uses less digits than its factorization.
106538820473784 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43098228459 (or 43098228455 counting only the distinct ones).
The product of its (nonzero) digits is 216760320, while the sum is 66.
The spelling of 106538820473784 in words is "one hundred six trillion, five hundred thirty-eight billion, eight hundred twenty million, four hundred seventy-three thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •