Base | Representation |
---|---|
bin | 11000010001010111010011… |
… | …111011010101100001000000 |
3 | 111222221212001121021112002221 |
4 | 120101113103323111201000 |
5 | 102442413040201122223 |
6 | 1015010335311220424 |
7 | 31325112515660650 |
oct | 3021272373254100 |
9 | 458855047245087 |
10 | 106746377754688 |
11 | 31015980408801 |
12 | bb801b5b17714 |
13 | 47741a9114169 |
14 | 1c507a3536360 |
15 | c51ab919bb5d |
hex | 6115d3ed5840 |
106746377754688 has 56 divisors (see below), whose sum is σ = 243827157963200. Its totient is φ = 45419322060288.
The previous prime is 106746377754673. The next prime is 106746377754689. The reversal of 106746377754688 is 886457773647601.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×1067463777546882 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106746377754689) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 857035443 + ... + 857159986.
It is an arithmetic number, because the mean of its divisors is an integer number (4354056392200).
Almost surely, 2106746377754688 is an apocalyptic number.
It is an amenable number.
106746377754688 is an abundant number, since it is smaller than the sum of its proper divisors (137080780208512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106746377754688 is a wasteful number, since it uses less digits than its factorization.
106746377754688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1714195587 (or 1714195577 counting only the distinct ones).
The product of its (nonzero) digits is 7965941760, while the sum is 79.
The spelling of 106746377754688 in words is "one hundred six trillion, seven hundred forty-six billion, three hundred seventy-seven million, seven hundred fifty-four thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •