Base | Representation |
---|---|
bin | 1100101110111… |
… | …00100111011111 |
3 | 21102222111112101 |
4 | 12113130213133 |
5 | 204320403243 |
6 | 14333145531 |
7 | 2434603621 |
oct | 627344737 |
9 | 242874471 |
10 | 106809823 |
11 | 5532288a |
12 | 2b92b2a7 |
13 | 191892a3 |
14 | 10284c11 |
15 | 959c54d |
hex | 65dc9df |
106809823 has 8 divisors (see below), whose sum is σ = 108304416. Its totient is φ = 105324000.
The previous prime is 106809799. The next prime is 106809847. The reversal of 106809823 is 328908601.
It is an interprime number because it is at equal distance from previous prime (106809799) and next prime (106809847).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106809823 - 217 = 106678751 is a prime.
It is a super-2 number, since 2×1068098232 = 22816676578582658, 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 (106809853) 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, 24553 + ... + 28573.
It is an arithmetic number, because the mean of its divisors is an integer number (13538052).
Almost surely, 2106809823 is an apocalyptic number.
106809823 is a deficient number, since it is larger than the sum of its proper divisors (1494593).
106809823 is a wasteful number, since it uses less digits than its factorization.
106809823 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4385.
The product of its (nonzero) digits is 20736, while the sum is 37.
The square root of 106809823 is about 10334.8837922833. The cubic root of 106809823 is about 474.4645090067.
It can be divided in two parts, 10680 and 9823, that added together give a triangular number (20503 = T202).
The spelling of 106809823 in words is "one hundred six million, eight hundred nine thousand, eight hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •