Base | Representation |
---|---|
bin | 1110000100100000000011010… |
… | …1000000000001100010000011 |
3 | 11210211200200211122000102020200 |
4 | 3201020000311000001202003 |
5 | 2014233440023130323021 |
6 | 13425442433055340243 |
7 | 415360111211205312 |
oct | 34110006500014203 |
9 | 4724620748012220 |
10 | 990111110011011 |
11 | 2675308445043aa |
12 | 9306a1bb521683 |
13 | 336611003735c1 |
14 | 1366d8c2154279 |
15 | 79700deb63126 |
hex | 3848035001883 |
990111110011011 has 12 divisors (see below), whose sum is σ = 1430178165082680. Its totient is φ = 660065916643200.
The previous prime is 990111110010991. The next prime is 990111110011027. The reversal of 990111110011011 is 110110011111099.
It is not a de Polignac number, because 990111110011011 - 26 = 990111110010947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (990111110011031) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 678955965 + ... + 680412686.
It is an arithmetic number, because the mean of its divisors is an integer number (119181513756890).
Almost surely, 2990111110011011 is an apocalyptic number.
990111110011011 is a deficient number, since it is larger than the sum of its proper divisors (440067055071669).
990111110011011 is a wasteful number, since it uses less digits than its factorization.
990111110011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1359449586 (or 1359449583 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 27.
The spelling of 990111110011011 in words is "nine hundred ninety trillion, one hundred eleven billion, one hundred ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •