Base | Representation |
---|---|
bin | 101101101110101011101100… |
… | …110101101110100111000110 |
3 | 222101002220011102011212120221 |
4 | 231232223230311232213012 |
5 | 202330122442200010042 |
6 | 1551425145355214554 |
7 | 60235306603206400 |
oct | 5556535465564706 |
9 | 871086142155527 |
10 | 201120112110022 |
11 | 590a0619106276 |
12 | 1a68251274745a |
13 | 882b711a35671 |
14 | 37943a0237b70 |
15 | 183b8e0553d67 |
hex | b6eaecd6e9c6 |
201120112110022 has 24 divisors (see below), whose sum is σ = 351065165924304. Its totient is φ = 86162135541552.
The previous prime is 201120112110007. The next prime is 201120112110023. The reversal of 201120112110022 is 220011211021102.
It is a junction number, because it is equal to n+sod(n) for n = 201120112109978 and 201120112110005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201120112110023) 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 in 11 ways as a sum of consecutive naturals, for example, 383048458 + ... + 383573149.
It is an arithmetic number, because the mean of its divisors is an integer number (14627715246846).
Almost surely, 2201120112110022 is an apocalyptic number.
201120112110022 is a deficient number, since it is larger than the sum of its proper divisors (149945053814282).
201120112110022 is a wasteful number, since it uses less digits than its factorization.
201120112110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766624300 (or 766624293 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201120112110022 its reverse (220011211021102), we get a palindrome (421131323131124).
The spelling of 201120112110022 in words is "two hundred one trillion, one hundred twenty billion, one hundred twelve million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •