Base | Representation |
---|---|
bin | 1001000110101100011010… |
… | …01011001111011111000001 |
3 | 2121220000020121220002022120 |
4 | 10203112031023033133001 |
5 | 10111011420020213441 |
6 | 110325341205354453 |
7 | 4134325163300556 |
oct | 443261513173701 |
9 | 77800217802276 |
10 | 20021211101121 |
11 | 6419a4779527a |
12 | 22b42b3108a29 |
13 | b22cb886b949 |
14 | 4d3063322a2d |
15 | 24abe70d1966 |
hex | 12358d2cf7c1 |
20021211101121 has 16 divisors (see below), whose sum is σ = 27575119269888. Its totient is φ = 12907983618000.
The previous prime is 20021211101119. The next prime is 20021211101191. The reversal of 20021211101121 is 12110111212002.
It is a happy number.
It is not a de Polignac number, because 20021211101121 - 21 = 20021211101119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20021211101121.
It is not an unprimeable number, because it can be changed into a prime (20021211101191) 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, 74254455 + ... + 74523596.
It is an arithmetic number, because the mean of its divisors is an integer number (1723444954368).
Almost surely, 220021211101121 is an apocalyptic number.
It is an amenable number.
20021211101121 is a deficient number, since it is larger than the sum of its proper divisors (7553908168767).
20021211101121 is a wasteful number, since it uses less digits than its factorization.
20021211101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148779532.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20021211101121 its reverse (12110111212002), we get a palindrome (32131322313123).
The spelling of 20021211101121 in words is "twenty trillion, twenty-one billion, two hundred eleven million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •