Base | Representation |
---|---|
bin | 11000010000001101000001… |
… | …011101101101110101111110 |
3 | 111222200020011112020212202200 |
4 | 120100031001131231311332 |
5 | 102440111204420331100 |
6 | 1014505544211132330 |
7 | 31316260026435255 |
oct | 3020150135556576 |
9 | 458606145225680 |
10 | 106666611105150 |
11 | 30a950681a3348 |
12 | bb688542a40a6 |
13 | 4769806442655 |
14 | 1c4a99778179c |
15 | c4e99b423e00 |
hex | 61034176dd7e |
106666611105150 has 72 divisors (see below), whose sum is σ = 286623291282744. Its totient is φ = 28439897342400.
The previous prime is 106666611105121. The next prime is 106666611105161. The reversal of 106666611105150 is 51501116666601.
It is a super-2 number, since 2×1066666111051502 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 106666611105096 and 106666611105105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 16056736 + ... + 21706035.
Almost surely, 2106666611105150 is an apocalyptic number.
106666611105150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106666611105150 is an abundant number, since it is smaller than the sum of its proper divisors (179956680177594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106666611105150 is a wasteful number, since it uses less digits than its factorization.
106666611105150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37769066 (or 37769058 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 45.
The spelling of 106666611105150 in words is "one hundred six trillion, six hundred sixty-six billion, six hundred eleven million, one hundred five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •