Base | Representation |
---|---|
bin | 110011001011010101… |
… | …0110100110011000110 |
3 | 101111200020222121110012 |
4 | 1212112222310303012 |
5 | 3300034402203420 |
6 | 122253245030222 |
7 | 10640321340152 |
oct | 1462652646306 |
9 | 344606877405 |
10 | 109901991110 |
11 | 4267789962a |
12 | 19371b55372 |
13 | a496102792 |
14 | 5468190062 |
15 | 2cd36d7dc5 |
hex | 1996ab4cc6 |
109901991110 has 8 divisors (see below), whose sum is σ = 197823584016. Its totient is φ = 43960796440.
The previous prime is 109901991109. The next prime is 109901991149. The reversal of 109901991110 is 11199109901.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5495099546 + ... + 5495099565.
It is an arithmetic number, because the mean of its divisors is an integer number (24727948002).
Almost surely, 2109901991110 is an apocalyptic number.
109901991110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109901991110 is a deficient number, since it is larger than the sum of its proper divisors (87921592906).
109901991110 is a wasteful number, since it uses less digits than its factorization.
109901991110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10990199118.
The product of its (nonzero) digits is 6561, while the sum is 41.
It can be divided in two parts, 109901 and 991110, that added together give a palindrome (1101011).
The spelling of 109901991110 in words is "one hundred nine billion, nine hundred one million, nine hundred ninety-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •