Base | Representation |
---|---|
bin | 11100110100001101001… |
… | …00001011101001001101 |
3 | 10111122121210000220022210 |
4 | 32122012210023221031 |
5 | 112210211112004101 |
6 | 2034502401301033 |
7 | 131350414034460 |
oct | 16320644135115 |
9 | 3448553026283 |
10 | 990100109901 |
11 | 351998777a41 |
12 | 13ba7a634779 |
13 | 7249b25cbc6 |
14 | 35cc77032d7 |
15 | 1ab4c5807d6 |
hex | e68690ba4d |
990100109901 has 16 divisors (see below), whose sum is σ = 1510799273984. Its totient is φ = 564993255024.
The previous prime is 990100109899. The next prime is 990100109959. The reversal of 990100109901 is 109901001099.
It is not a de Polignac number, because 990100109901 - 21 = 990100109899 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 990100109901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (990100109101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32410885 + ... + 32441418.
It is an arithmetic number, because the mean of its divisors is an integer number (94424954624).
Almost surely, 2990100109901 is an apocalyptic number.
It is an amenable number.
990100109901 is a deficient number, since it is larger than the sum of its proper divisors (520699164083).
990100109901 is a wasteful number, since it uses less digits than its factorization.
990100109901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64853040.
The product of its (nonzero) digits is 6561, while the sum is 39.
The spelling of 990100109901 in words is "nine hundred ninety billion, one hundred million, one hundred nine thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •