Base | Representation |
---|---|
bin | 10010101001011010… |
… | …010000110111001101 |
3 | 1220200101010020112221 |
4 | 102221122100313031 |
5 | 312001124303001 |
6 | 13110435055341 |
7 | 1306111033411 |
oct | 225132206715 |
9 | 56611106487 |
10 | 20022103501 |
11 | 8544a56784 |
12 | 3a69441551 |
13 | 1b7114662a |
14 | d7d1dad41 |
15 | 7c2b851a1 |
hex | 4a9690dcd |
20022103501 has 4 divisors (see below), whose sum is σ = 20022399232. Its totient is φ = 20021807772.
The previous prime is 20022103489. The next prime is 20022103523. The reversal of 20022103501 is 10530122002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 20022103501 - 211 = 20022101453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022103601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9556 + ... + 200338.
It is an arithmetic number, because the mean of its divisors is an integer number (5005599808).
Almost surely, 220022103501 is an apocalyptic number.
It is an amenable number.
20022103501 is a deficient number, since it is larger than the sum of its proper divisors (295731).
20022103501 is a wasteful number, since it uses less digits than its factorization.
20022103501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295730.
The product of its (nonzero) digits is 120, while the sum is 16.
Adding to 20022103501 its reverse (10530122002), we get a palindrome (30552225503).
The spelling of 20022103501 in words is "twenty billion, twenty-two million, one hundred three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •