Base | Representation |
---|---|
bin | 100011101101101100011011… |
… | …001101110111000000011111 |
3 | 202121010220112020011200001221 |
4 | 203231230123031313000133 |
5 | 131041430323113200111 |
6 | 1314021425001314211 |
7 | 45041025201441235 |
oct | 4355543315670037 |
9 | 677126466150057 |
10 | 157071705600031 |
11 | 46058810a62182 |
12 | 15749670495967 |
13 | 6984a4ba99371 |
14 | 2ab044d9aa955 |
15 | 1325bded4c371 |
hex | 8edb1b37701f |
157071705600031 has 2 divisors, whose sum is σ = 157071705600032. Its totient is φ = 157071705600030.
The previous prime is 157071705600001. The next prime is 157071705600079. The reversal of 157071705600031 is 130006507170751.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 157071705600031 - 25 = 157071705599999 is a prime.
It is a super-2 number, since 2×1570717056000312 (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 (157071705600001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78535852800015 + 78535852800016.
It is an arithmetic number, because the mean of its divisors is an integer number (78535852800016).
Almost surely, 2157071705600031 is an apocalyptic number.
157071705600031 is a deficient number, since it is larger than the sum of its proper divisors (1).
157071705600031 is an equidigital number, since it uses as much as digits as its factorization.
157071705600031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 154350, while the sum is 43.
The spelling of 157071705600031 in words is "one hundred fifty-seven trillion, seventy-one billion, seven hundred five million, six hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •