Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0011110111011010101 |
3 | 100122221220202020222211 |
4 | 1132022012132323111 |
5 | 3124023402000112 |
6 | 114240101353421 |
7 | 10206245022223 |
oct | 1361206367325 |
9 | 318856666884 |
10 | 101101203157 |
11 | 39970aa2359 |
12 | 17716708871 |
13 | 96c29c1c46 |
14 | 4c713d3b13 |
15 | 296ac5c0a7 |
hex | 178a19eed5 |
101101203157 has 2 divisors, whose sum is σ = 101101203158. Its totient is φ = 101101203156.
The previous prime is 101101203121. The next prime is 101101203167. The reversal of 101101203157 is 751302101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92897553681 + 8203649476 = 304791^2 + 90574^2 .
It is an emirp because it is prime and its reverse (751302101101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101101203157 is a prime.
It is a super-3 number, since 3×1011012031573 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101101203167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550601578 + 50550601579.
It is an arithmetic number, because the mean of its divisors is an integer number (50550601579).
Almost surely, 2101101203157 is an apocalyptic number.
It is an amenable number.
101101203157 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101203157 is an equidigital number, since it uses as much as digits as its factorization.
101101203157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 210, while the sum is 22.
Adding to 101101203157 its reverse (751302101101), we get a palindrome (852403304258).
The spelling of 101101203157 in words is "one hundred one billion, one hundred one million, two hundred three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •