Base | Representation |
---|---|
bin | 11000010101111001001000… |
… | …000100001010101110011101 |
3 | 112001001121021200212012021001 |
4 | 120111321020010022232131 |
5 | 103013012342322402112 |
6 | 1015405322121510301 |
7 | 31356440143223563 |
oct | 3025711004125635 |
9 | 461047250765231 |
10 | 107057563872157 |
11 | 31125948903688 |
12 | 10010581642391 |
13 | 479763c5a3892 |
14 | 1c61884155a33 |
15 | c59c2d910c57 |
hex | 615e4810ab9d |
107057563872157 has 2 divisors, whose sum is σ = 107057563872158. Its totient is φ = 107057563872156.
The previous prime is 107057563872113. The next prime is 107057563872187. The reversal of 107057563872157 is 751278365750701.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102993493342041 + 4064070530116 = 10148571^2 + 2015954^2 .
It is a cyclic number.
It is not a de Polignac number, because 107057563872157 - 231 = 107055416388509 is a prime.
It is a super-2 number, since 2×1070575638721572 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107057563872107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53528781936078 + 53528781936079.
It is an arithmetic number, because the mean of its divisors is an integer number (53528781936079).
Almost surely, 2107057563872157 is an apocalyptic number.
It is an amenable number.
107057563872157 is a deficient number, since it is larger than the sum of its proper divisors (1).
107057563872157 is an equidigital number, since it uses as much as digits as its factorization.
107057563872157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86436000, while the sum is 64.
The spelling of 107057563872157 in words is "one hundred seven trillion, fifty-seven billion, five hundred sixty-three million, eight hundred seventy-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •