Base | Representation |
---|---|
bin | 11000001001110010101100… |
… | …100011001001110101011110 |
3 | 111221010002221101202122210002 |
4 | 120021302230203021311132 |
5 | 102410401400132424100 |
6 | 1013531321312414302 |
7 | 31242401644364642 |
oct | 3011625443116536 |
9 | 457102841678702 |
10 | 106226026061150 |
11 | 3093522844a776 |
12 | bab7395247392 |
13 | 47370c0791798 |
14 | 1c3351d43cc22 |
15 | c432b19cc2d5 |
hex | 609cac8c9d5e |
106226026061150 has 24 divisors (see below), whose sum is σ = 197580719560320. Its totient is φ = 42490343524160.
The previous prime is 106226026061143. The next prime is 106226026061227. The reversal of 106226026061150 is 51160620622601.
It is a super-2 number, since 2×1062260260611502 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41367986 + ... + 43860714.
It is an arithmetic number, because the mean of its divisors is an integer number (8232529981680).
Almost surely, 2106226026061150 is an apocalyptic number.
106226026061150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106226026061150 is a deficient number, since it is larger than the sum of its proper divisors (91354693499170).
106226026061150 is a wasteful number, since it uses less digits than its factorization.
106226026061150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3345028 (or 3345023 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 38.
Adding to 106226026061150 its reverse (51160620622601), we get a palindrome (157386646683751).
The spelling of 106226026061150 in words is "one hundred six trillion, two hundred twenty-six billion, twenty-six million, sixty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •