Base | Representation |
---|---|
bin | 1100101111001… |
… | …00000101101111 |
3 | 21110001001112000 |
4 | 12113210011233 |
5 | 204322343211 |
6 | 14333543343 |
7 | 2435062065 |
oct | 627440557 |
9 | 243031460 |
10 | 106840431 |
11 | 55343885 |
12 | 2b944b53 |
13 | 1919a1b9 |
14 | 10292035 |
15 | 95a6656 |
hex | 65e416f |
106840431 has 8 divisors (see below), whose sum is σ = 158282160. Its totient is φ = 71226936.
The previous prime is 106840429. The next prime is 106840507. The reversal of 106840431 is 134048601.
It is not a de Polignac number, because 106840431 - 21 = 106840429 is a prime.
It is a super-2 number, since 2×1068404312 = 22829755392531522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 3957053 = 106840431 / (1 + 0 + 6 + 8 + 4 + 0 + 4 + 3 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 106840395 and 106840404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106840831) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1978500 + ... + 1978553.
It is an arithmetic number, because the mean of its divisors is an integer number (19785270).
Almost surely, 2106840431 is an apocalyptic number.
106840431 is a deficient number, since it is larger than the sum of its proper divisors (51441729).
106840431 is an equidigital number, since it uses as much as digits as its factorization.
106840431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3957062 (or 3957056 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 106840431 is about 10336.3644962820. The cubic root of 106840431 is about 474.5098263827.
The spelling of 106840431 in words is "one hundred six million, eight hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •