Base | Representation |
---|---|
bin | 10110011100010100000… |
… | …100111111101101100001 |
3 | 12110102202200001011022022 |
4 | 112130110010333231201 |
5 | 200231441402104441 |
6 | 3140253555351225 |
7 | 216264620444615 |
oct | 26342404775541 |
9 | 5412680034268 |
10 | 1542230113121 |
11 | 545068769425 |
12 | 20aa898b2515 |
13 | b257c511b19 |
14 | 549040b3345 |
15 | 2a1b4a4a84b |
hex | 1671413fb61 |
1542230113121 has 2 divisors, whose sum is σ = 1542230113122. Its totient is φ = 1542230113120.
The previous prime is 1542230113079. The next prime is 1542230113147. The reversal of 1542230113121 is 1213110322451.
It is an a-pointer prime, because the next prime (1542230113147) can be obtained adding 1542230113121 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1534404941521 + 7825171600 = 1238711^2 + 88460^2 .
It is a cyclic number.
It is not a de Polignac number, because 1542230113121 - 218 = 1542229850977 is a prime.
It is not a weakly prime, because it can be changed into another prime (1542230119121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 771115056560 + 771115056561.
It is an arithmetic number, because the mean of its divisors is an integer number (771115056561).
Almost surely, 21542230113121 is an apocalyptic number.
It is an amenable number.
1542230113121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1542230113121 is an equidigital number, since it uses as much as digits as its factorization.
1542230113121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 1542230113121 its reverse (1213110322451), we get a palindrome (2755340435572).
The spelling of 1542230113121 in words is "one trillion, five hundred forty-two billion, two hundred thirty million, one hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •