Base | Representation |
---|---|
bin | 11110101110000110010… |
… | …10111010110000100101 |
3 | 10201220112111101020010012 |
4 | 33113003022322300211 |
5 | 114243222100004012 |
6 | 2124524203340005 |
7 | 136155204630425 |
oct | 17270312726045 |
9 | 3656474336105 |
10 | 1055541406757 |
11 | 37771a673952 |
12 | 1506a2821605 |
13 | 786ca0b9176 |
14 | 39134acc485 |
15 | 1c6cc859622 |
hex | f5c32bac25 |
1055541406757 has 2 divisors, whose sum is σ = 1055541406758. Its totient is φ = 1055541406756.
The previous prime is 1055541406721. The next prime is 1055541406807. The reversal of 1055541406757 is 7576041455501.
It is an a-pointer prime, because the next prime (1055541406807) can be obtained adding 1055541406757 to its sum of digits (50).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1013859692836 + 41681713921 = 1006906^2 + 204161^2 .
It is a cyclic number.
It is not a de Polignac number, because 1055541406757 - 212 = 1055541402661 is a prime.
It is a super-2 number, since 2×10555414067572 (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 (1055541406657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527770703378 + 527770703379.
It is an arithmetic number, because the mean of its divisors is an integer number (527770703379).
Almost surely, 21055541406757 is an apocalyptic number.
It is an amenable number.
1055541406757 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055541406757 is an equidigital number, since it uses as much as digits as its factorization.
1055541406757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2940000, while the sum is 50.
The spelling of 1055541406757 in words is "one trillion, fifty-five billion, five hundred forty-one million, four hundred six thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •