Base | Representation |
---|---|
bin | 1001000110101100011001… |
… | …00101011110011111100001 |
3 | 2121220000012221021010001220 |
4 | 10203112030211132133201 |
5 | 10111011410001413441 |
6 | 110325340213245253 |
7 | 4134325013165601 |
oct | 443261445363741 |
9 | 77800187233056 |
10 | 20021201201121 |
11 | 6419a4214325a |
12 | 22b42ab933829 |
13 | b22cb67b3763 |
14 | 4d3061ca6c01 |
15 | 24abe62c8466 |
hex | 12358c95e7e1 |
20021201201121 has 16 divisors (see below), whose sum is σ = 28280832879168. Its totient is φ = 12555385587200.
The previous prime is 20021201201059. The next prime is 20021201201123. The reversal of 20021201201121 is 12110210212002.
It is a cyclic number.
It is not a de Polignac number, because 20021201201121 - 27 = 20021201200993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20021201201121.
It is not an unprimeable number, because it can be changed into a prime (20021201201123) 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, 108293220 + ... + 108477941.
It is an arithmetic number, because the mean of its divisors is an integer number (1767552054948).
Almost surely, 220021201201121 is an apocalyptic number.
It is an amenable number.
20021201201121 is a deficient number, since it is larger than the sum of its proper divisors (8259631678047).
20021201201121 is a wasteful number, since it uses less digits than its factorization.
20021201201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216772992.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20021201201121 its reverse (12110210212002), we get a palindrome (32131411413123).
The spelling of 20021201201121 in words is "twenty trillion, twenty-one billion, two hundred one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •