Base | Representation |
---|---|
bin | 1110000100011111111111100… |
… | …0110110111111101010100111 |
3 | 11210211200121020022101220121000 |
4 | 3201013333320312333222213 |
5 | 2014233430441324323421 |
6 | 13425442145013124343 |
7 | 415360044206641533 |
oct | 34107777066775247 |
9 | 4724617208356530 |
10 | 990110101011111 |
11 | 2675303769a3893 |
12 | 93069b796296b3 |
13 | 33660c9c304b42 |
14 | 1366d828142bc3 |
15 | 79700812a5226 |
hex | 3847ff8dbfaa7 |
990110101011111 has 32 divisors (see below), whose sum is σ = 1494861571938240. Its totient is φ = 647465023296000.
The previous prime is 990110101011103. The next prime is 990110101011151. The reversal of 990110101011111 is 111110101011099.
It is not a de Polignac number, because 990110101011111 - 23 = 990110101011103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (990110101011151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76337910 + ... + 88361171.
It is an arithmetic number, because the mean of its divisors is an integer number (46714424123070).
Almost surely, 2990110101011111 is an apocalyptic number.
990110101011111 is a deficient number, since it is larger than the sum of its proper divisors (504751470927129).
990110101011111 is a wasteful number, since it uses less digits than its factorization.
990110101011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164703344 (or 164703338 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 27.
The spelling of 990110101011111 in words is "nine hundred ninety trillion, one hundred ten billion, one hundred one million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •