Base | Representation |
---|---|
bin | 110001101010011101… |
… | …1011100001000111010 |
3 | 101012021201201221100002 |
4 | 1203110323130020322 |
5 | 3221410300113100 |
6 | 120554533113002 |
7 | 10463632234046 |
oct | 1432473341072 |
9 | 335251657302 |
10 | 106651566650 |
11 | 4125a035622 |
12 | 18805488762 |
13 | a09888a5b5 |
14 | 523a5db026 |
15 | 2b931792d5 |
hex | 18d4edc23a |
106651566650 has 48 divisors (see below), whose sum is σ = 208968500160. Its totient is φ = 40385145600.
The previous prime is 106651566647. The next prime is 106651566713. The reversal of 106651566650 is 56665156601.
It is a super-2 number, since 2×1066515666502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106651566595 and 106651566604.
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 23 ways as a sum of consecutive naturals, for example, 1251707 + ... + 1334193.
It is an arithmetic number, because the mean of its divisors is an integer number (4353510420).
Almost surely, 2106651566650 is an apocalyptic number.
106651566650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106651566650 is a deficient number, since it is larger than the sum of its proper divisors (102316933510).
106651566650 is a wasteful number, since it uses less digits than its factorization.
106651566650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83879 (or 83874 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 47.
The spelling of 106651566650 in words is "one hundred six billion, six hundred fifty-one million, five hundred sixty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •