Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0010000100111111001 |
3 | 100122222202022220221121 |
4 | 1132022310100213321 |
5 | 3124034440000233 |
6 | 114241210505241 |
7 | 10206452021602 |
oct | 1361264204771 |
9 | 318882286847 |
10 | 101113203193 |
11 | 39977849142 |
12 | 1771a735221 |
13 | 96c5333c62 |
14 | 4c72c38da9 |
15 | 296bd2c92d |
hex | 178ad109f9 |
101113203193 has 2 divisors, whose sum is σ = 101113203194. Its totient is φ = 101113203192.
The previous prime is 101113203187. The next prime is 101113203199. The reversal of 101113203193 is 391302311101.
It is a balanced prime because it is at equal distance from previous prime (101113203187) and next prime (101113203199).
It can be written as a sum of positive squares in only one way, i.e., 84101740009 + 17011463184 = 290003^2 + 130428^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101113203193 is a prime.
It is not a weakly prime, because it can be changed into another prime (101113203199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556601596 + 50556601597.
It is an arithmetic number, because the mean of its divisors is an integer number (50556601597).
Almost surely, 2101113203193 is an apocalyptic number.
It is an amenable number.
101113203193 is a deficient number, since it is larger than the sum of its proper divisors (1).
101113203193 is an equidigital number, since it uses as much as digits as its factorization.
101113203193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 25.
Adding to 101113203193 its reverse (391302311101), we get a palindrome (492415514294).
The spelling of 101113203193 in words is "one hundred one billion, one hundred thirteen million, two hundred three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •