Base | Representation |
---|---|
bin | 1110000100100000100101100… |
… | …0110101110010100001101111 |
3 | 11210211201120120011221100111222 |
4 | 3201020021120311302201233 |
5 | 2014234112334104224404 |
6 | 13425450553111333555 |
7 | 415360555035323441 |
oct | 34110113065624157 |
9 | 4724646504840458 |
10 | 990120301242479 |
11 | 267534730739670 |
12 | 9306bb456812bb |
13 | 33661c3662a9c4 |
14 | 13670114b08491 |
15 | 797047ba15dbe |
hex | 3848258d7286f |
990120301242479 has 64 divisors (see below), whose sum is σ = 1164714683424768. Its totient is φ = 832296392294400.
The previous prime is 990120301242469. The next prime is 990120301242557. The reversal of 990120301242479 is 974242103021099.
It is not a de Polignac number, because 990120301242479 - 232 = 990116006275183 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 990120301242479.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (990120301242469) 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 63 ways as a sum of consecutive naturals, for example, 55822300499 + ... + 55822318235.
It is an arithmetic number, because the mean of its divisors is an integer number (18198666928512).
Almost surely, 2990120301242479 is an apocalyptic number.
990120301242479 is a deficient number, since it is larger than the sum of its proper divisors (174594382182289).
990120301242479 is a wasteful number, since it uses less digits than its factorization.
990120301242479 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25128.
The product of its (nonzero) digits is 1959552, while the sum is 53.
The spelling of 990120301242479 in words is "nine hundred ninety trillion, one hundred twenty billion, three hundred one million, two hundred forty-two thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •