Base | Representation |
---|---|
bin | 11000001111111110100101… |
… | …100010010001010110110110 |
3 | 111222121202011020110212000011 |
4 | 120033332211202101112312 |
5 | 102434332433144322411 |
6 | 1014454502120010434 |
7 | 31315200634501006 |
oct | 3017764542212666 |
9 | 458552136425004 |
10 | 106651110151606 |
11 | 30a89533323539 |
12 | bb65849000a1a |
13 | 4768205b994a7 |
14 | 1c49d26bd8006 |
15 | c4e390658c21 |
hex | 60ffa58915b6 |
106651110151606 has 8 divisors (see below), whose sum is σ = 160081156848744. Its totient is φ = 53290724535360.
The previous prime is 106651110151603. The next prime is 106651110151609. The reversal of 106651110151606 is 606151011156601.
It is an interprime number because it is at equal distance from previous prime (106651110151603) and next prime (106651110151609).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1066511101516063 (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 not an unprimeable number, because it can be changed into a prime (106651110151603) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17415266395 + ... + 17415272518.
It is an arithmetic number, because the mean of its divisors is an integer number (20010144606093).
Almost surely, 2106651110151606 is an apocalyptic number.
106651110151606 is a deficient number, since it is larger than the sum of its proper divisors (53430046697138).
106651110151606 is a wasteful number, since it uses less digits than its factorization.
106651110151606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34830540446.
The product of its (nonzero) digits is 32400, while the sum is 40.
The spelling of 106651110151606 in words is "one hundred six trillion, six hundred fifty-one billion, one hundred ten million, one hundred fifty-one thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •