Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …110011001001011010000110 |
3 | 222100200102011222220202011220 |
4 | 231230323312303021122012 |
5 | 202321141020122334342 |
6 | 1551254045015141210 |
7 | 60223525606146150 |
oct | 5554736663113206 |
9 | 870612158822156 |
10 | 201000020121222 |
11 | 590546a2331653 |
12 | 1a663198074806 |
13 | 88202b378106a |
14 | 378c64a9c7ad0 |
15 | 183871247c5ec |
hex | b6cef6cc9686 |
201000020121222 has 128 divisors (see below), whose sum is σ = 491019337829376. Its totient is φ = 53543186522112.
The previous prime is 201000020121167. The next prime is 201000020121223. The reversal of 201000020121222 is 222121020000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000020121223) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3608784478 + ... + 3608840174.
It is an arithmetic number, because the mean of its divisors is an integer number (3836088576792).
Almost surely, 2201000020121222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201000020121222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (245509668914688).
201000020121222 is an abundant number, since it is smaller than the sum of its proper divisors (290019317708154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201000020121222 is a wasteful number, since it uses less digits than its factorization.
201000020121222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103070.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201000020121222 its reverse (222121020000102), we get a palindrome (423121040121324).
The spelling of 201000020121222 in words is "two hundred one trillion, twenty million, one hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •