Base | Representation |
---|---|
bin | 101111000101010110… |
… | …0100111110011011111 |
3 | 100122222121120012102222 |
4 | 1132022230213303133 |
5 | 3124033431412431 |
6 | 114241055535555 |
7 | 10206426012353 |
oct | 1361254476337 |
9 | 318877505388 |
10 | 101111200991 |
11 | 39976700929 |
12 | 17719b2a5bb |
13 | 96c4ab2818 |
14 | 4c72877463 |
15 | 296ba8457b |
hex | 178ab27cdf |
101111200991 has 2 divisors, whose sum is σ = 101111200992. Its totient is φ = 101111200990.
The previous prime is 101111200987. The next prime is 101111201029. The reversal of 101111200991 is 199002111101.
It is a weak prime.
It is an emirp because it is prime and its reverse (199002111101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101111200991 - 22 = 101111200987 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101111200991.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101111205991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555600495 + 50555600496.
It is an arithmetic number, because the mean of its divisors is an integer number (50555600496).
Almost surely, 2101111200991 is an apocalyptic number.
101111200991 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111200991 is an equidigital number, since it uses as much as digits as its factorization.
101111200991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 26.
The spelling of 101111200991 in words is "one hundred one billion, one hundred eleven million, two hundred thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •