Base | Representation |
---|---|
bin | 110011000011011111… |
… | …0010011111001001101 |
3 | 101110222220111012020021 |
4 | 1212012332103321031 |
5 | 3244014444220012 |
6 | 122211201022141 |
7 | 10630643160010 |
oct | 1460676237115 |
9 | 343886435207 |
10 | 109638663757 |
11 | 42552192917 |
12 | 192b9924951 |
13 | a4536a4b8c |
14 | 5441205377 |
15 | 2cba520007 |
hex | 1986f93e4d |
109638663757 has 16 divisors (see below), whose sum is σ = 126131691520. Its totient is φ = 93353792112.
The previous prime is 109638663731. The next prime is 109638663779. The reversal of 109638663757 is 757366836901.
It is not a de Polignac number, because 109638663757 - 211 = 109638661709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 109638663695 and 109638663704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109638663707) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2422744 + ... + 2467582.
It is an arithmetic number, because the mean of its divisors is an integer number (7883230720).
Almost surely, 2109638663757 is an apocalyptic number.
It is an amenable number.
109638663757 is a deficient number, since it is larger than the sum of its proper divisors (16493027763).
109638663757 is a wasteful number, since it uses less digits than its factorization.
109638663757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47152.
The product of its (nonzero) digits is 34292160, while the sum is 61.
The spelling of 109638663757 in words is "one hundred nine billion, six hundred thirty-eight million, six hundred sixty-three thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •