Base | Representation |
---|---|
bin | 11100110100001110010… |
… | …01111100111001111001 |
3 | 10111122122110122221002012 |
4 | 32122013021330321321 |
5 | 112210221130323001 |
6 | 2034503353415305 |
7 | 131350564142606 |
oct | 16320711747171 |
9 | 3448573587065 |
10 | 990110011001 |
11 | 3519a331a871 |
12 | 13ba81a0a535 |
13 | 724a0318747 |
14 | 35cc8b5d6ad |
15 | 1ab4d3892bb |
hex | e68727ce79 |
990110011001 has 16 divisors (see below), whose sum is σ = 1052349081408. Its totient is φ = 928316928000.
The previous prime is 990110010979. The next prime is 990110011043. The reversal of 990110011001 is 100110011099.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 990110011001 - 214 = 990109994617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (990110071001) 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, 18500441 + ... + 18553881.
It is an arithmetic number, because the mean of its divisors is an integer number (65771817588).
Almost surely, 2990110011001 is an apocalyptic number.
It is an amenable number.
990110011001 is a deficient number, since it is larger than the sum of its proper divisors (62239070407).
990110011001 is a wasteful number, since it uses less digits than its factorization.
990110011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57592.
The product of its (nonzero) digits is 81, while the sum is 23.
The spelling of 990110011001 in words is "nine hundred ninety billion, one hundred ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •