Base | Representation |
---|---|
bin | 11100110100110001100… |
… | …11100010001011110101 |
3 | 10111200102002212001010120 |
4 | 32122120303202023311 |
5 | 112211322431434102 |
6 | 2034553012242153 |
7 | 131361121103613 |
oct | 16323063421365 |
9 | 3450362761116 |
10 | 990406124277 |
11 | 35203548a089 |
12 | 13bb45010359 |
13 | 725197853bb |
14 | 35d162006b3 |
15 | 1ab6937b6bc |
hex | e698ce22f5 |
990406124277 has 32 divisors (see below), whose sum is σ = 1401795134208. Its totient is φ = 619843961856.
The previous prime is 990406124249. The next prime is 990406124303. The reversal of 990406124277 is 772421604099.
It is not a de Polignac number, because 990406124277 - 211 = 990406122229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (990406124777) 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, 49577263 + ... + 49597235.
It is an arithmetic number, because the mean of its divisors is an integer number (43806097944).
Almost surely, 2990406124277 is an apocalyptic number.
It is an amenable number.
990406124277 is a deficient number, since it is larger than the sum of its proper divisors (411389009931).
990406124277 is a wasteful number, since it uses less digits than its factorization.
990406124277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22429.
The product of its (nonzero) digits is 1524096, while the sum is 51.
The spelling of 990406124277 in words is "nine hundred ninety billion, four hundred six million, one hundred twenty-four thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •