Base | Representation |
---|---|
bin | 110011000100011001… |
… | …0010111001001101001 |
3 | 101111002000201210102122 |
4 | 1212020302113021221 |
5 | 3244100241221201 |
6 | 122214205041025 |
7 | 10631462564012 |
oct | 1461062271151 |
9 | 344060653378 |
10 | 109669085801 |
11 | 42568381400 |
12 | 19307b56175 |
13 | a459a96ca2 |
14 | 5445284009 |
15 | 2cbd02de1b |
hex | 1988c97269 |
109669085801 has 6 divisors (see below), whose sum is σ = 120545358906. Its totient is φ = 99699168800.
The previous prime is 109669085689. The next prime is 109669085807. The reversal of 109669085801 is 108580966901.
It can be written as a sum of positive squares in only one way, i.e., 105586003600 + 4083082201 = 324940^2 + 63899^2 .
It is a de Polignac number, because none of the positive numbers 2k-109669085801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109669085807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 453177920 + ... + 453178161.
It is an arithmetic number, because the mean of its divisors is an integer number (20090893151).
Almost surely, 2109669085801 is an apocalyptic number.
109669085801 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
109669085801 is a deficient number, since it is larger than the sum of its proper divisors (10876273105).
109669085801 is an equidigital number, since it uses as much as digits as its factorization.
109669085801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 906356103 (or 906356092 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 53.
The spelling of 109669085801 in words is "one hundred nine billion, six hundred sixty-nine million, eighty-five thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •