Base | Representation |
---|---|
bin | 11100110100011000111… |
… | …01011101011100011101 |
3 | 10111122212200010121021012 |
4 | 32122030131131130131 |
5 | 112210411421323401 |
6 | 2034520253145005 |
7 | 131353024502246 |
oct | 16321435353435 |
9 | 3448780117235 |
10 | 990199011101 |
11 | 351a39588973 |
12 | 13baa778b165 |
13 | 724b58aa521 |
14 | 35cd68c9ccd |
15 | 1ab560b98bb |
hex | e68c75d71d |
990199011101 has 8 divisors (see below), whose sum is σ = 1049628041280. Its totient is φ = 930901317568.
The previous prime is 990199011083. The next prime is 990199011187. The reversal of 990199011101 is 101110991099.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 990199011101 - 222 = 990194816797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (990199011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32818631 + ... + 32848788.
It is an arithmetic number, because the mean of its divisors is an integer number (131203505160).
Almost surely, 2990199011101 is an apocalyptic number.
It is an amenable number.
990199011101 is a deficient number, since it is larger than the sum of its proper divisors (59429030179).
990199011101 is a wasteful number, since it uses less digits than its factorization.
990199011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65668323.
The product of its (nonzero) digits is 6561, while the sum is 41.
The spelling of 990199011101 in words is "nine hundred ninety billion, one hundred ninety-nine million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •