Base | Representation |
---|---|
bin | 1100101011010… |
… | …10111111010101 |
3 | 21102002212002200 |
4 | 12111222333111 |
5 | 204211010110 |
6 | 14315155113 |
7 | 2430624666 |
oct | 625527725 |
9 | 242085080 |
10 | 106344405 |
11 | 55035142 |
12 | 2b745a99 |
13 | 190554ab |
14 | 101a336d |
15 | 95096c0 |
hex | 656afd5 |
106344405 has 12 divisors (see below), whose sum is σ = 184330380. Its totient is φ = 56716992.
The previous prime is 106344379. The next prime is 106344419. The reversal of 106344405 is 504443601.
It can be written as a sum of positive squares in 2 ways, for example, as 12680721 + 93663684 = 3561^2 + 9678^2 .
It is not a de Polignac number, because 106344405 - 28 = 106344149 is a prime.
It is a super-2 number, since 2×1063444052 = 22618264949608050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1181560 + ... + 1181649.
It is an arithmetic number, because the mean of its divisors is an integer number (15360865).
Almost surely, 2106344405 is an apocalyptic number.
106344405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106344405 is a deficient number, since it is larger than the sum of its proper divisors (77985975).
106344405 is a wasteful number, since it uses less digits than its factorization.
106344405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2363220 (or 2363217 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 106344405 is about 10312.3423624315. The cubic root of 106344405 is about 473.7743544913.
The spelling of 106344405 in words is "one hundred six million, three hundred forty-four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •