Base | Representation |
---|---|
bin | 1001001011111011010101… |
… | …00111110011001011001011 |
3 | 2122112012100211002010111011 |
4 | 10211331222213303023023 |
5 | 10121433142110324321 |
6 | 110544115342344351 |
7 | 4153322051643334 |
oct | 445755247631313 |
9 | 78465324063434 |
10 | 20201020011211 |
11 | 648922817a806 |
12 | 232311488b0b7 |
13 | b36c42a28630 |
14 | 4dba3d9b928b |
15 | 25071cb40ae1 |
hex | 125f6a9f32cb |
20201020011211 has 8 divisors (see below), whose sum is σ = 21758835770784. Its totient is φ = 18643760129280.
The previous prime is 20201020011167. The next prime is 20201020011247. The reversal of 20201020011211 is 11211002010202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20201020011211 - 27 = 20201020011083 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20201020011191 and 20201020011200.
It is not an unprimeable number, because it can be changed into a prime (20201020311211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138893926 + ... + 139039291.
It is an arithmetic number, because the mean of its divisors is an integer number (2719854471348).
Almost surely, 220201020011211 is an apocalyptic number.
20201020011211 is a deficient number, since it is larger than the sum of its proper divisors (1557815759573).
20201020011211 is a wasteful number, since it uses less digits than its factorization.
20201020011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277938821.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20201020011211 its reverse (11211002010202), we get a palindrome (31412022021413).
The spelling of 20201020011211 in words is "twenty trillion, two hundred one billion, twenty million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •