Base | Representation |
---|---|
bin | 101111001011000100… |
… | …0101100101000110001 |
3 | 100200110222200012101012 |
4 | 1132112020230220301 |
5 | 3124432044011233 |
6 | 114312113120305 |
7 | 10214246141405 |
oct | 1362610545061 |
9 | 320428605335 |
10 | 101303110193 |
11 | 39a64a6807a |
12 | 17772259095 |
13 | 972579626c |
14 | 4c90151105 |
15 | 297d841548 |
hex | 179622ca31 |
101303110193 has 2 divisors, whose sum is σ = 101303110194. Its totient is φ = 101303110192.
The previous prime is 101303110187. The next prime is 101303110241. The reversal of 101303110193 is 391011303101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54602603584 + 46700506609 = 233672^2 + 216103^2 .
It is an emirp because it is prime and its reverse (391011303101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101303110193 - 28 = 101303109937 is a prime.
It is not a weakly prime, because it can be changed into another prime (101303110093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50651555096 + 50651555097.
It is an arithmetic number, because the mean of its divisors is an integer number (50651555097).
Almost surely, 2101303110193 is an apocalyptic number.
It is an amenable number.
101303110193 is a deficient number, since it is larger than the sum of its proper divisors (1).
101303110193 is an equidigital number, since it uses as much as digits as its factorization.
101303110193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 23.
Adding to 101303110193 its reverse (391011303101), we get a palindrome (492314413294).
The spelling of 101303110193 in words is "one hundred one billion, three hundred three million, one hundred ten thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •