Base | Representation |
---|---|
bin | 1100100001000… |
… | …10110010110111 |
3 | 21022120120002022 |
4 | 12100202302313 |
5 | 203340000434 |
6 | 14230303355 |
7 | 2413325540 |
oct | 620426267 |
9 | 238516068 |
10 | 105000119 |
11 | 542a7164 |
12 | 2b1b7b5b |
13 | 189a4663 |
14 | dd334c7 |
15 | 934122e |
hex | 6422cb7 |
105000119 has 4 divisors (see below), whose sum is σ = 120000144. Its totient is φ = 90000096.
The previous prime is 105000107. The next prime is 105000121. The reversal of 105000119 is 911000501.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105000119 - 224 = 88222903 is a prime.
It is a super-2 number, since 2×1050001192 = 22050049980028322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105000097 and 105000106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105000169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7500002 + ... + 7500015.
It is an arithmetic number, because the mean of its divisors is an integer number (30000036).
Almost surely, 2105000119 is an apocalyptic number.
105000119 is a deficient number, since it is larger than the sum of its proper divisors (15000025).
105000119 is an equidigital number, since it uses as much as digits as its factorization.
105000119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15000024.
The product of its (nonzero) digits is 45, while the sum is 17.
The square root of 105000119 is about 10246.9565725634. The cubic root of 105000119 is about 471.7695762556.
The spelling of 105000119 in words is "one hundred five million, one hundred nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •