Base | Representation |
---|---|
bin | 1001001100011110101101… |
… | …00100101011010101111011 |
3 | 2122121000101022222101020011 |
4 | 10212033112210223111323 |
5 | 10122241040304014321 |
6 | 111000540025242351 |
7 | 4154563502462200 |
oct | 446172644532573 |
9 | 78530338871204 |
10 | 20220011001211 |
11 | 649629309166a |
12 | 23269349333b7 |
13 | b3897b360018 |
14 | 4dc921c89ca7 |
15 | 250e7eeeaae1 |
hex | 1263d692b57b |
20220011001211 has 12 divisors (see below), whose sum is σ = 23852522323440. Its totient is φ = 17087333237520.
The previous prime is 20220011001199. The next prime is 20220011001217. The reversal of 20220011001211 is 11210011002202.
It is not a de Polignac number, because 20220011001211 - 27 = 20220011001083 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20220011001191 and 20220011001200.
It is not an unprimeable number, because it can be changed into a prime (20220011001217) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2906005576 + ... + 2906012533.
It is an arithmetic number, because the mean of its divisors is an integer number (1987710193620).
Almost surely, 220220011001211 is an apocalyptic number.
20220011001211 is a deficient number, since it is larger than the sum of its proper divisors (3632511322229).
20220011001211 is an equidigital number, since it uses as much as digits as its factorization.
20220011001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5812018194 (or 5812018187 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20220011001211 its reverse (11210011002202), we get a palindrome (31430022003413).
Subtracting from 20220011001211 its reverse (11210011002202), we obtain a palindrome (9009999999009).
The spelling of 20220011001211 in words is "twenty trillion, two hundred twenty billion, eleven million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •