Base | Representation |
---|---|
bin | 110001101110001010… |
… | …0110000011111011001 |
3 | 101012121101012201121222 |
4 | 1203130110300133121 |
5 | 3222134031102441 |
6 | 121015124341425 |
7 | 10466666666666 |
oct | 1433424603731 |
9 | 335541181558 |
10 | 106775644121 |
11 | 41313081893 |
12 | 1883ab44875 |
13 | a0b84b1413 |
14 | 524cc98a6d |
15 | 2b9ded7d4b |
hex | 18dc5307d9 |
106775644121 has 4 divisors (see below), whose sum is σ = 107482767744. Its totient is φ = 106068520500.
The previous prime is 106775644109. The next prime is 106775644139. The reversal of 106775644121 is 121446577601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106775644121 - 26 = 106775644057 is a prime.
It is a super-2 number, since 2×1067756441212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106775644141) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 353561585 + ... + 353561886.
It is an arithmetic number, because the mean of its divisors is an integer number (26870691936).
Almost surely, 2106775644121 is an apocalyptic number.
It is an amenable number.
106775644121 is a deficient number, since it is larger than the sum of its proper divisors (707123623).
106775644121 is an equidigital number, since it uses as much as digits as its factorization.
106775644121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707123622.
The product of its (nonzero) digits is 282240, while the sum is 44.
The spelling of 106775644121 in words is "one hundred six billion, seven hundred seventy-five million, six hundred forty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •