Base | Representation |
---|---|
bin | 11110010111101111110… |
… | …10011000001000000101 |
3 | 10200202120012011202012212 |
4 | 33023313322120020011 |
5 | 114044133042024112 |
6 | 2115221332553205 |
7 | 135251633133641 |
oct | 17136772301005 |
9 | 3622505152185 |
10 | 1043541361157 |
11 | 372621990a99 |
12 | 14a2b3a82805 |
13 | 77536c39979 |
14 | 3871709bc21 |
15 | 1c2290ca522 |
hex | f2f7e98205 |
1043541361157 has 2 divisors, whose sum is σ = 1043541361158. Its totient is φ = 1043541361156.
The previous prime is 1043541361151. The next prime is 1043541361183. The reversal of 1043541361157 is 7511631453401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 889350846916 + 154190514241 = 943054^2 + 392671^2 .
It is a cyclic number.
It is not a de Polignac number, because 1043541361157 - 228 = 1043272925701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1043541361151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521770680578 + 521770680579.
It is an arithmetic number, because the mean of its divisors is an integer number (521770680579).
Almost surely, 21043541361157 is an apocalyptic number.
It is an amenable number.
1043541361157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1043541361157 is an equidigital number, since it uses as much as digits as its factorization.
1043541361157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 41.
The spelling of 1043541361157 in words is "one trillion, forty-three billion, five hundred forty-one million, three hundred sixty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •