Base | Representation |
---|---|
bin | 1100101000010… |
… | …10111010001101 |
3 | 21101100212020222 |
4 | 12110022322031 |
5 | 204110411421 |
6 | 14302521125 |
7 | 2424365432 |
oct | 624127215 |
9 | 241325228 |
10 | 105950861 |
11 | 548964a5 |
12 | 2b5961a5 |
13 | 18c48323 |
14 | 100ddb89 |
15 | 947ccab |
hex | 650ae8d |
105950861 has 4 divisors (see below), whose sum is σ = 106038300. Its totient is φ = 105863424.
The previous prime is 105950849. The next prime is 105950863. The reversal of 105950861 is 168059501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 57912100 + 48038761 = 7610^2 + 6931^2 .
It is a cyclic number.
It is not a de Polignac number, because 105950861 - 226 = 38841997 is a prime.
It is a super-2 number, since 2×1059508612 = 22451169893282642, which 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 (105950863) 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, 41876 + ... + 44333.
It is an arithmetic number, because the mean of its divisors is an integer number (26509575).
Almost surely, 2105950861 is an apocalyptic number.
It is an amenable number.
105950861 is a deficient number, since it is larger than the sum of its proper divisors (87439).
105950861 is an equidigital number, since it uses as much as digits as its factorization.
105950861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87438.
The product of its (nonzero) digits is 10800, while the sum is 35.
The square root of 105950861 is about 10293.2434635541. The cubic root of 105950861 is about 473.1892068739.
The spelling of 105950861 in words is "one hundred five million, nine hundred fifty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •