Base | Representation |
---|---|
bin | 10010000110000010001… |
… | …101100100110010000101 |
3 | 11101212111210012002001011 |
4 | 102012002031210302011 |
5 | 130333021104121112 |
6 | 2351120211202221 |
7 | 155556233563024 |
oct | 22060215446205 |
9 | 4355453162034 |
10 | 1243430145157 |
11 | 43a37699aa42 |
12 | 180b9a2a6371 |
13 | 903411b9155 |
14 | 4427a4ac8bb |
15 | 225278d1aa7 |
hex | 12182364c85 |
1243430145157 has 2 divisors, whose sum is σ = 1243430145158. Its totient is φ = 1243430145156.
The previous prime is 1243430145119. The next prime is 1243430145187. The reversal of 1243430145157 is 7515410343421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 831061963876 + 412368181281 = 911626^2 + 642159^2 .
It is a cyclic number.
It is not a de Polignac number, because 1243430145157 - 227 = 1243295927429 is a prime.
It is a super-2 number, since 2×12434301451572 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1243430145187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 621715072578 + 621715072579.
It is an arithmetic number, because the mean of its divisors is an integer number (621715072579).
Almost surely, 21243430145157 is an apocalyptic number.
It is an amenable number.
1243430145157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1243430145157 is an equidigital number, since it uses as much as digits as its factorization.
1243430145157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 201600, while the sum is 40.
Adding to 1243430145157 its reverse (7515410343421), we get a palindrome (8758840488578).
The spelling of 1243430145157 in words is "one trillion, two hundred forty-three billion, four hundred thirty million, one hundred forty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •