Base | Representation |
---|---|
bin | 10010101001011010… |
… | …010010100001110001 |
3 | 1220200101010120220112 |
4 | 102221122102201301 |
5 | 312001130012241 |
6 | 13110435151105 |
7 | 1306111062323 |
oct | 225132224161 |
9 | 56611116815 |
10 | 20022110321 |
11 | 8544a60914 |
12 | 3a69445495 |
13 | 1b71149775 |
14 | d7d1dd613 |
15 | 7c2b871eb |
hex | 4a9692871 |
20022110321 has 4 divisors (see below), whose sum is σ = 20199297252. Its totient is φ = 19844923392.
The previous prime is 20022110293. The next prime is 20022110357. The reversal of 20022110321 is 12301122002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11244481600 + 8777628721 = 106040^2 + 93689^2 .
It is a cyclic number.
It is not a de Polignac number, because 20022110321 - 26 = 20022110257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20022110296 and 20022110305.
It is not an unprimeable number, because it can be changed into a prime (20022116321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88593296 + ... + 88593521.
It is an arithmetic number, because the mean of its divisors is an integer number (5049824313).
Almost surely, 220022110321 is an apocalyptic number.
It is an amenable number.
20022110321 is a deficient number, since it is larger than the sum of its proper divisors (177186931).
20022110321 is a wasteful number, since it uses less digits than its factorization.
20022110321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177186930.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 20022110321 its reverse (12301122002), we get a palindrome (32323232323).
The spelling of 20022110321 in words is "twenty billion, twenty-two million, one hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •