Base | Representation |
---|---|
bin | 1100101000010… |
… | …01010010010101 |
3 | 21101100112010202 |
4 | 12110021102111 |
5 | 204110203323 |
6 | 14302430245 |
7 | 2424340154 |
oct | 624112225 |
9 | 241315122 |
10 | 105944213 |
11 | 54891501 |
12 | 2b592385 |
13 | 18c452ab |
14 | 100db59b |
15 | 947ad28 |
hex | 6509495 |
105944213 has 4 divisors (see below), whose sum is σ = 106075980. Its totient is φ = 105812448.
The previous prime is 105944207. The next prime is 105944227. The reversal of 105944213 is 312449501.
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 51509329 + 54434884 = 7177^2 + 7378^2 .
It is a cyclic number.
It is not a de Polignac number, because 105944213 - 24 = 105944197 is a prime.
It is a super-2 number, since 2×1059442132 = 22448352536378738, 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 (105944203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64670 + ... + 66287.
It is an arithmetic number, because the mean of its divisors is an integer number (26518995).
Almost surely, 2105944213 is an apocalyptic number.
It is an amenable number.
105944213 is a deficient number, since it is larger than the sum of its proper divisors (131767).
105944213 is an equidigital number, since it uses as much as digits as its factorization.
105944213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131766.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 105944213 is about 10292.9205282077. The cubic root of 105944213 is about 473.1793097461.
The spelling of 105944213 in words is "one hundred five million, nine hundred forty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •