Base | Representation |
---|---|
bin | 10010110101001110… |
… | …000001001001110111 |
3 | 1221012011220121022220 |
4 | 102311032001021313 |
5 | 312402334020043 |
6 | 13142233253423 |
7 | 1314035014533 |
oct | 226516011167 |
9 | 57164817286 |
10 | 20220220023 |
11 | 8636872643 |
12 | 3b03864273 |
13 | 1ba31c1543 |
14 | d9b64cbc3 |
15 | 7d526b483 |
hex | 4b5381277 |
20220220023 has 8 divisors (see below), whose sum is σ = 28132480128. Its totient is φ = 12894053304.
The previous prime is 20220219989. The next prime is 20220220049. The reversal of 20220220023 is 32002202202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20220220023 - 212 = 20220215927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20220219984 and 20220220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220220123) 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 7 ways as a sum of consecutive naturals, for example, 146523265 + ... + 146523402.
It is an arithmetic number, because the mean of its divisors is an integer number (3516560016).
Almost surely, 220220220023 is an apocalyptic number.
20220220023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
20220220023 is a deficient number, since it is larger than the sum of its proper divisors (7912260105).
20220220023 is a wasteful number, since it uses less digits than its factorization.
20220220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293046693.
The product of its (nonzero) digits is 192, while the sum is 15.
Adding to 20220220023 its reverse (32002202202), we get a palindrome (52222422225).
The spelling of 20220220023 in words is "twenty billion, two hundred twenty million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •