Base | Representation |
---|---|
bin | 11110110010001000101… |
… | …11000010100001111101 |
3 | 10202010010112210111200101 |
4 | 33121010113002201331 |
5 | 114312141431021211 |
6 | 2125523231201101 |
7 | 136263003562042 |
oct | 17310427024175 |
9 | 3663115714611 |
10 | 1057708845181 |
11 | 37863208347a |
12 | 150ba8676191 |
13 | 78984159901 |
14 | 3929c8d11c9 |
15 | 1c7a7c935c1 |
hex | f6445c287d |
1057708845181 has 2 divisors, whose sum is σ = 1057708845182. Its totient is φ = 1057708845180.
The previous prime is 1057708845143. The next prime is 1057708845227. The reversal of 1057708845181 is 1815488077501.
1057708845181 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 936859447225 + 120849397956 = 967915^2 + 347634^2 .
It is a cyclic number.
It is not a de Polignac number, because 1057708845181 - 233 = 1049118910589 is a prime.
It is a super-2 number, since 2×10577088451812 (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 (1057708815181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528854422590 + 528854422591.
It is an arithmetic number, because the mean of its divisors is an integer number (528854422591).
Almost surely, 21057708845181 is an apocalyptic number.
It is an amenable number.
1057708845181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1057708845181 is an equidigital number, since it uses as much as digits as its factorization.
1057708845181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2508800, while the sum is 55.
The spelling of 1057708845181 in words is "one trillion, fifty-seven billion, seven hundred eight million, eight hundred forty-five thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •