Base | Representation |
---|---|
bin | 11100110100011000110… |
… | …10000011100111111111 |
3 | 10111122212121110021102010 |
4 | 32122030122003213333 |
5 | 112210411204301121 |
6 | 2034520222102303 |
7 | 131353014065151 |
oct | 16321432034777 |
9 | 3448777407363 |
10 | 990198118911 |
11 | 351a39029621 |
12 | 13baa741a993 |
13 | 724b56573c1 |
14 | 35cd6736ad1 |
15 | 1ab55e90376 |
hex | e68c6839ff |
990198118911 has 16 divisors (see below), whose sum is σ = 1390959267840. Its totient is φ = 624844900800.
The previous prime is 990198118849. The next prime is 990198118939. The reversal of 990198118911 is 119811891099.
It is not a de Polignac number, because 990198118911 - 213 = 990198110719 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (990198118991) 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 15 ways as a sum of consecutive naturals, for example, 7480830 + ... + 7612043.
It is an arithmetic number, because the mean of its divisors is an integer number (86934954240).
Almost surely, 2990198118911 is an apocalyptic number.
990198118911 is a deficient number, since it is larger than the sum of its proper divisors (400761148929).
990198118911 is a wasteful number, since it uses less digits than its factorization.
990198118911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15094046.
The product of its (nonzero) digits is 419904, while the sum is 57.
The spelling of 990198118911 in words is "nine hundred ninety billion, one hundred ninety-eight million, one hundred eighteen thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •