Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …11000111010011101111011 |
3 | 2121211000000102002122100211 |
4 | 10203002220320322131323 |
5 | 10110140403003101021 |
6 | 110311544323011551 |
7 | 4132652426255653 |
oct | 443025070723573 |
9 | 77730012078324 |
10 | 20000201222011 |
11 | 641104620511a |
12 | 22b020ab09bb7 |
13 | b2101aba830a |
14 | 4d202cc7b363 |
15 | 24a3b78823e1 |
hex | 1230a8e3a77b |
20000201222011 has 16 divisors (see below), whose sum is σ = 20468194725888. Its totient is φ = 19534018532800.
The previous prime is 20000201221981. The next prime is 20000201222017. The reversal of 20000201222011 is 11022210200002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20000201222011 - 211 = 20000201219963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20000201221982 and 20000201222000.
It is not an unprimeable number, because it can be changed into a prime (20000201222017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44026071 + ... + 44478031.
It is an arithmetic number, because the mean of its divisors is an integer number (1279262170368).
Almost surely, 220000201222011 is an apocalyptic number.
20000201222011 is a deficient number, since it is larger than the sum of its proper divisors (467993503877).
20000201222011 is a wasteful number, since it uses less digits than its factorization.
20000201222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453962.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20000201222011 its reverse (11022210200002), we get a palindrome (31022411422013).
The spelling of 20000201222011 in words is "twenty trillion, two hundred one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •