Base | Representation |
---|---|
bin | 1100100111001… |
… | …11111000010011 |
3 | 21101002120102211 |
4 | 12103213320103 |
5 | 204041314004 |
6 | 14255452551 |
7 | 2423230216 |
oct | 623477023 |
9 | 241076384 |
10 | 105807379 |
11 | 547a8717 |
12 | 2b527157 |
13 | 18bc7c22 |
14 | 100a377d |
15 | 9450504 |
hex | 64e7e13 |
105807379 has 4 divisors (see below), whose sum is σ = 105878376. Its totient is φ = 105736384.
The previous prime is 105807353. The next prime is 105807407. The reversal of 105807379 is 973708501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 973708501 = 6143 ⋅158507.
It is a cyclic number.
It is not a de Polignac number, because 105807379 - 29 = 105806867 is a prime.
It is a super-2 number, since 2×1058073792 = 22390402901699282, which contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105807179) 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, 33214 + ... + 36259.
It is an arithmetic number, because the mean of its divisors is an integer number (26469594).
Almost surely, 2105807379 is an apocalyptic number.
105807379 is a deficient number, since it is larger than the sum of its proper divisors (70997).
105807379 is an equidigital number, since it uses as much as digits as its factorization.
105807379 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70996.
The product of its (nonzero) digits is 52920, while the sum is 40.
The square root of 105807379 is about 10286.2713847147. The cubic root of 105807379 is about 472.9755077926.
The spelling of 105807379 in words is "one hundred five million, eight hundred seven thousand, three hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •