Base | Representation |
---|---|
bin | 1101000010110… |
… | …11011000110101 |
3 | 21121220102120022 |
4 | 12201123120311 |
5 | 211003114404 |
6 | 14505214525 |
7 | 2466051623 |
oct | 641333065 |
9 | 247812508 |
10 | 109426229 |
11 | 5684a600 |
12 | 30791445 |
13 | 19894163 |
14 | 10766513 |
15 | 99178be |
hex | 685b635 |
109426229 has 12 divisors (see below), whose sum is σ = 127356012. Its totient is φ = 93624960.
The previous prime is 109426223. The next prime is 109426237. The reversal of 109426229 is 922624901.
It can be written as a sum of positive squares in 2 ways, for example, as 80964004 + 28462225 = 8998^2 + 5335^2 .
It is a de Polignac number, because none of the positive numbers 2k-109426229 is a prime.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109426223) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24542 + ... + 28655.
It is an arithmetic number, because the mean of its divisors is an integer number (10613001).
Almost surely, 2109426229 is an apocalyptic number.
It is an amenable number.
109426229 is a deficient number, since it is larger than the sum of its proper divisors (17929783).
109426229 is a wasteful number, since it uses less digits than its factorization.
109426229 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53236 (or 53225 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 35.
The square root of 109426229 is about 10460.6992596098. The cubic root of 109426229 is about 478.3074488402.
It can be divided in two parts, 10942 and 6229, that added together give a palindrome (17171).
The spelling of 109426229 in words is "one hundred nine million, four hundred twenty-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •