Base | Representation |
---|---|
bin | 110011001100011000… |
… | …0001110011001010110 |
3 | 101111202200210021021101 |
4 | 1212120300032121112 |
5 | 3300122330223420 |
6 | 122300534340314 |
7 | 10641224515414 |
oct | 1463060163126 |
9 | 344680707241 |
10 | 109936961110 |
11 | 42695604059 |
12 | 193817ba69a |
13 | a4a04279a2 |
14 | 546ca942b4 |
15 | 2cd67e460a |
hex | 1998c0e656 |
109936961110 has 8 divisors (see below), whose sum is σ = 197886530016. Its totient is φ = 43974784440.
The previous prime is 109936961107. The next prime is 109936961119. The reversal of 109936961110 is 11169639901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1099369611102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109936961119) 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 3 ways as a sum of consecutive naturals, for example, 5496848046 + ... + 5496848065.
It is an arithmetic number, because the mean of its divisors is an integer number (24735816252).
Almost surely, 2109936961110 is an apocalyptic number.
109936961110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109936961110 is a deficient number, since it is larger than the sum of its proper divisors (87949568906).
109936961110 is a wasteful number, since it uses less digits than its factorization.
109936961110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10993696118.
The product of its (nonzero) digits is 78732, while the sum is 46.
The spelling of 109936961110 in words is "one hundred nine billion, nine hundred thirty-six million, nine hundred sixty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •