Base | Representation |
---|---|
bin | 110000111100011001… |
… | …0000100011000000101 |
3 | 101001021222202000012202 |
4 | 1201320302010120011 |
5 | 3210224013344044 |
6 | 120141305524245 |
7 | 10410420624425 |
oct | 1417062043005 |
9 | 331258660182 |
10 | 105105606149 |
11 | 40636413615 |
12 | 184537a3685 |
13 | 9bb04c577b |
14 | 5131172485 |
15 | 2b025a1c4e |
hex | 1878c84605 |
105105606149 has 4 divisors (see below), whose sum is σ = 109675415136. Its totient is φ = 100535797164.
The previous prime is 105105606131. The next prime is 105105606157. The reversal of 105105606149 is 941606501501.
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, and also an emirpimes, since its reverse is a distinct semiprime: 941606501501 = 47 ⋅20034180883.
It is a cyclic number.
It is not a de Polignac number, because 105105606149 - 216 = 105105540613 is a prime.
It is a super-2 number, since 2×1051056061492 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105105606119) 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, 2284904459 + ... + 2284904504.
It is an arithmetic number, because the mean of its divisors is an integer number (27418853784).
Almost surely, 2105105606149 is an apocalyptic number.
It is an amenable number.
105105606149 is a deficient number, since it is larger than the sum of its proper divisors (4569808987).
105105606149 is an equidigital number, since it uses as much as digits as its factorization.
105105606149 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4569808986.
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 105105606149 in words is "one hundred five billion, one hundred five million, six hundred six thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •