Base | Representation |
---|---|
bin | 1110000100100000100101100… |
… | …0110101110010100010111101 |
3 | 11210211201120120011221100121212 |
4 | 3201020021120311302202331 |
5 | 2014234112334104230212 |
6 | 13425450553111334205 |
7 | 415360555035323612 |
oct | 34110113065624275 |
9 | 4724646504840555 |
10 | 990120301242557 |
11 | 267534730739731 |
12 | 9306bb45681365 |
13 | 33661c3662aa54 |
14 | 13670114b08509 |
15 | 797047ba15e22 |
hex | 3848258d728bd |
990120301242557 has 2 divisors, whose sum is σ = 990120301242558. Its totient is φ = 990120301242556.
The previous prime is 990120301242469. The next prime is 990120301242581. The reversal of 990120301242557 is 755242103021099.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 922495681192996 + 67624620049561 = 30372614^2 + 8223419^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-990120301242557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (990120801242557) 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 as a sum of consecutive naturals, namely, 495060150621278 + 495060150621279.
It is an arithmetic number, because the mean of its divisors is an integer number (495060150621279).
Almost surely, 2990120301242557 is an apocalyptic number.
It is an amenable number.
990120301242557 is a deficient number, since it is larger than the sum of its proper divisors (1).
990120301242557 is an equidigital number, since it uses as much as digits as its factorization.
990120301242557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1360800, while the sum is 50.
The spelling of 990120301242557 in words is "nine hundred ninety trillion, one hundred twenty billion, three hundred one million, two hundred forty-two thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •