Base | Representation |
---|---|
bin | 100000000111000… |
… | …1000001110100101 |
3 | 2210002101220102102 |
4 | 1000032020032211 |
5 | 4201311224131 |
6 | 254525221445 |
7 | 35462064434 |
oct | 10016101645 |
9 | 2702356372 |
10 | 1077445541 |
11 | 50320a867 |
12 | 260a01885 |
13 | 1422b4953 |
14 | a314b11b |
15 | 648cd1cb |
hex | 403883a5 |
1077445541 has 2 divisors, whose sum is σ = 1077445542. Its totient is φ = 1077445540.
The previous prime is 1077445487. The next prime is 1077445543. The reversal of 1077445541 is 1455447701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 726033025 + 351412516 = 26945^2 + 18746^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1077445541 is a prime.
Together with 1077445543, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1077445495 and 1077445504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1077445543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 538722770 + 538722771.
It is an arithmetic number, because the mean of its divisors is an integer number (538722771).
Almost surely, 21077445541 is an apocalyptic number.
It is an amenable number.
1077445541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1077445541 is an equidigital number, since it uses as much as digits as its factorization.
1077445541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78400, while the sum is 38.
The square root of 1077445541 is about 32824.4655859010. The cubic root of 1077445541 is about 1025.1760287804.
The spelling of 1077445541 in words is "one billion, seventy-seven million, four hundred forty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •