Base | Representation |
---|---|
bin | 1101000100111… |
… | …00101011010001 |
3 | 21122102000101202 |
4 | 12202130223101 |
5 | 211040144044 |
6 | 14515040545 |
7 | 2501244362 |
oct | 642345321 |
9 | 248360352 |
10 | 109693649 |
11 | 56a1250a |
12 | 308a0155 |
13 | 19958ab0 |
14 | 107d5b69 |
15 | 996bc4e |
hex | 689cad1 |
109693649 has 4 divisors (see below), whose sum is σ = 118131636. Its totient is φ = 101255664.
The previous prime is 109693643. The next prime is 109693679. The reversal of 109693649 is 946396901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 946396901 = 683 ⋅1385647.
It can be written as a sum of positive squares in 2 ways, for example, as 9193024 + 100500625 = 3032^2 + 10025^2 .
It is a cyclic number.
It is not a de Polignac number, because 109693649 - 28 = 109693393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109693643) 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, 4218974 + ... + 4218999.
It is an arithmetic number, because the mean of its divisors is an integer number (29532909).
Almost surely, 2109693649 is an apocalyptic number.
It is an amenable number.
109693649 is a deficient number, since it is larger than the sum of its proper divisors (8437987).
109693649 is an equidigital number, since it uses as much as digits as its factorization.
109693649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8437986.
The product of its (nonzero) digits is 314928, while the sum is 47.
The square root of 109693649 is about 10473.4735880700. The cubic root of 109693649 is about 478.6967672089.
The spelling of 109693649 in words is "one hundred nine million, six hundred ninety-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •