Base | Representation |
---|---|
bin | 101111111111110000… |
… | …1001101000100001101 |
3 | 100212001012112112021112 |
4 | 1133333201031010031 |
5 | 3142042203022112 |
6 | 115203352141405 |
7 | 10306125152504 |
oct | 1377741150415 |
9 | 325035475245 |
10 | 103071142157 |
11 | 3a791a77715 |
12 | 17b86397865 |
13 | 9947b72619 |
14 | 4dbaca583b |
15 | 2a33b82a22 |
hex | 17ff84d10d |
103071142157 has 2 divisors, whose sum is σ = 103071142158. Its totient is φ = 103071142156.
The previous prime is 103071142147. The next prime is 103071142199. The reversal of 103071142157 is 751241170301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102634373956 + 436768201 = 320366^2 + 20899^2 .
It is a cyclic number.
It is not a de Polignac number, because 103071142157 - 216 = 103071076621 is a prime.
It is a super-2 number, since 2×1030711421572 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103071142147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51535571078 + 51535571079.
It is an arithmetic number, because the mean of its divisors is an integer number (51535571079).
Almost surely, 2103071142157 is an apocalyptic number.
It is an amenable number.
103071142157 is a deficient number, since it is larger than the sum of its proper divisors (1).
103071142157 is an equidigital number, since it uses as much as digits as its factorization.
103071142157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5880, while the sum is 32.
The spelling of 103071142157 in words is "one hundred three billion, seventy-one million, one hundred forty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •