Base | Representation |
---|---|
bin | 101101101100111011111100… |
… | …111000100011000000101111 |
3 | 222100200102110002222220002111 |
4 | 231230323330320203000233 |
5 | 202321141222240400421 |
6 | 1551254103103104451 |
7 | 60223531255620223 |
oct | 5554737470430057 |
9 | 870612402886074 |
10 | 201000122200111 |
11 | 59054744a12a73 |
12 | 1a6632062a2127 |
13 | 88202cb971b80 |
14 | 378c65a39a783 |
15 | 183871b3e2ee1 |
hex | b6cefce2302f |
201000122200111 has 48 divisors (see below), whose sum is σ = 224085533241024. Its totient is φ = 179219779200000.
The previous prime is 201000122200093. The next prime is 201000122200127. The reversal of 201000122200111 is 111002221000102.
It is not a de Polignac number, because 201000122200111 - 25 = 201000122200079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 201000122200091 and 201000122200100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000122200511) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 25439829261 + ... + 25439837161.
It is an arithmetic number, because the mean of its divisors is an integer number (4668448609188).
Almost surely, 2201000122200111 is an apocalyptic number.
201000122200111 is a deficient number, since it is larger than the sum of its proper divisors (23085411040913).
201000122200111 is a wasteful number, since it uses less digits than its factorization.
201000122200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11504 (or 11473 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201000122200111 its reverse (111002221000102), we get a palindrome (312002343200213).
The spelling of 201000122200111 in words is "two hundred one trillion, one hundred twenty-two million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •