Base | Representation |
---|---|
bin | 1101000010101… |
… | …11001000101101 |
3 | 21121212112200021 |
4 | 12201113020231 |
5 | 211002040223 |
6 | 14505002141 |
7 | 2465650063 |
oct | 641271055 |
9 | 247775607 |
10 | 109408813 |
11 | 56838508 |
12 | 30783351 |
13 | 19889257 |
14 | 10760033 |
15 | 991265d |
hex | 685722d |
109408813 has 4 divisors (see below), whose sum is σ = 111953248. Its totient is φ = 106864380.
The previous prime is 109408781. The next prime is 109408829. The reversal of 109408813 is 318804901.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 318804901 = 47 ⋅6783083.
It is a cyclic number.
It is not a de Polignac number, because 109408813 - 25 = 109408781 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109408843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1272153 + ... + 1272238.
It is an arithmetic number, because the mean of its divisors is an integer number (27988312).
Almost surely, 2109408813 is an apocalyptic number.
It is an amenable number.
109408813 is a deficient number, since it is larger than the sum of its proper divisors (2544435).
109408813 is an equidigital number, since it uses as much as digits as its factorization.
109408813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2544434.
The product of its (nonzero) digits is 6912, while the sum is 34.
The square root of 109408813 is about 10459.8667773543. The cubic root of 109408813 is about 478.2820720952.
The spelling of 109408813 in words is "one hundred nine million, four hundred eight thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •