Base | Representation |
---|---|
bin | 10010110101001101… |
… | …001100001111111001 |
3 | 1221012011111121001220 |
4 | 102311031030033321 |
5 | 312402310101241 |
6 | 13142224502253 |
7 | 1314033123000 |
oct | 226515141771 |
9 | 57164447056 |
10 | 20220003321 |
11 | 8636734851 |
12 | 3b0377a989 |
13 | 1ba3146a0b |
14 | d9b5d3c37 |
15 | 7d5227166 |
hex | 4b534c3f9 |
20220003321 has 32 divisors (see below), whose sum is σ = 31543142400. Its totient is φ = 11516471568.
The previous prime is 20220003289. The next prime is 20220003329. The reversal of 20220003321 is 12330002202.
It is not a de Polignac number, because 20220003321 - 25 = 20220003289 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20220003321.
It is not an unprimeable number, because it can be changed into a prime (20220003329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 283900 + ... + 347906.
It is an arithmetic number, because the mean of its divisors is an integer number (985723200).
Almost surely, 220220003321 is an apocalyptic number.
20220003321 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20220003321 is a deficient number, since it is larger than the sum of its proper divisors (11323139079).
20220003321 is an equidigital number, since it uses as much as digits as its factorization.
20220003321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64338 (or 64324 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 20220003321 its reverse (12330002202), we get a palindrome (32550005523).
The spelling of 20220003321 in words is "twenty billion, two hundred twenty million, three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •