Base | Representation |
---|---|
bin | 101101101110101011100111… |
… | …011010100101110011001011 |
3 | 222101002212221001221120222101 |
4 | 231232223213122211303023 |
5 | 202330122300401004323 |
6 | 1551425132344534231 |
7 | 60235304416550164 |
oct | 5556534732456313 |
9 | 871085831846871 |
10 | 201120021109963 |
11 | 590a058180160a |
12 | 1a6824a8181377 |
13 | 882b6c8c23487 |
14 | 379439210a76b |
15 | 183b8d757adad |
hex | b6eae76a5ccb |
201120021109963 has 2 divisors, whose sum is σ = 201120021109964. Its totient is φ = 201120021109962.
The previous prime is 201120021109939. The next prime is 201120021110081. The reversal of 201120021109963 is 369901120021102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201120021109963 - 29 = 201120021109451 is a prime.
It is a super-2 number, since 2×2011200211099632 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201120021104963) 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, 100560010554981 + 100560010554982.
It is an arithmetic number, because the mean of its divisors is an integer number (100560010554982).
Almost surely, 2201120021109963 is an apocalyptic number.
201120021109963 is a deficient number, since it is larger than the sum of its proper divisors (1).
201120021109963 is an equidigital number, since it uses as much as digits as its factorization.
201120021109963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 201120021109963 in words is "two hundred one trillion, one hundred twenty billion, twenty-one million, one hundred nine thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •