Base | Representation |
---|---|
bin | 101101101110011001111111… |
… | …101000101101000011101011 |
3 | 222101001002002102202012121011 |
4 | 231232121333220231003223 |
5 | 202324320023112010214 |
6 | 1551412323042124351 |
7 | 60234034505654152 |
oct | 5556317750550353 |
9 | 871032072665534 |
10 | 201101100110059 |
11 | 59093552354306 |
12 | 1a67a8a76506b7 |
13 | 88299a1c55c46 |
14 | 37934b9258599 |
15 | 183b17b3e8ac4 |
hex | b6e67fa2d0eb |
201101100110059 has 2 divisors, whose sum is σ = 201101100110060. Its totient is φ = 201101100110058.
The previous prime is 201101100109999. The next prime is 201101100110143. The reversal of 201101100110059 is 950011001101102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201101100110059 - 233 = 201092510175467 is a prime.
It is not a weakly prime, because it can be changed into another prime (201101100110959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550550055029 + 100550550055030.
It is an arithmetic number, because the mean of its divisors is an integer number (100550550055030).
Almost surely, 2201101100110059 is an apocalyptic number.
201101100110059 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101100110059 is an equidigital number, since it uses as much as digits as its factorization.
201101100110059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 22.
The spelling of 201101100110059 in words is "two hundred one trillion, one hundred one billion, one hundred million, one hundred ten thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •