Base | Representation |
---|---|
bin | 10101001101010101010… |
… | …001000000101110101101 |
3 | 12011022212102012101211001 |
4 | 111031111101000232231 |
5 | 142334301123424031 |
6 | 3033310451400301 |
7 | 210203223210142 |
oct | 25152521005655 |
9 | 5138772171731 |
10 | 1457424436141 |
11 | 5120aa110083 |
12 | 1b65605b3091 |
13 | a758589877b |
14 | 5077adbc3c9 |
15 | 27d9e70c861 |
hex | 15355440bad |
1457424436141 has 2 divisors, whose sum is σ = 1457424436142. Its totient is φ = 1457424436140.
The previous prime is 1457424436129. The next prime is 1457424436201. The reversal of 1457424436141 is 1416344247541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1427821857225 + 29602578916 = 1194915^2 + 172054^2 .
It is a cyclic number.
It is not a de Polignac number, because 1457424436141 - 25 = 1457424436109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1457424436091 and 1457424436100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1457424436441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 728712218070 + 728712218071.
It is an arithmetic number, because the mean of its divisors is an integer number (728712218071).
Almost surely, 21457424436141 is an apocalyptic number.
It is an amenable number.
1457424436141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1457424436141 is an equidigital number, since it uses as much as digits as its factorization.
1457424436141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1290240, while the sum is 46.
The spelling of 1457424436141 in words is "one trillion, four hundred fifty-seven billion, four hundred twenty-four million, four hundred thirty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •