Base | Representation |
---|---|
bin | 101101101100111100110010… |
… | …100001110011111111100110 |
3 | 222100200111202211112010120220 |
4 | 231230330302201303333212 |
5 | 202321200043141210042 |
6 | 1551254332253305210 |
7 | 60223562464566636 |
oct | 5554746241637746 |
9 | 870614684463526 |
10 | 201001022210022 |
11 | 59055066a51811 |
12 | 1a663417795206 |
13 | 882041326cc08 |
14 | 378c703b1a6c6 |
15 | 18387704228ec |
hex | b6cf32873fe6 |
201001022210022 has 128 divisors (see below), whose sum is σ = 447511237931520. Its totient is φ = 59921951907840.
The previous prime is 201001022209987. The next prime is 201001022210033. The reversal of 201001022210022 is 220012220100102.
It is a junction number, because it is equal to n+sod(n) for n = 201001022209983 and 201001022210010.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 20907133 + ... + 28967399.
It is an arithmetic number, because the mean of its divisors is an integer number (3496181546340).
Almost surely, 2201001022210022 is an apocalyptic number.
201001022210022 is an abundant number, since it is smaller than the sum of its proper divisors (246510215721498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201001022210022 is a wasteful number, since it uses less digits than its factorization.
201001022210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8060486.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201001022210022 its reverse (220012220100102), we get a palindrome (421013242310124).
The spelling of 201001022210022 in words is "two hundred one trillion, one billion, twenty-two million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •