Base | Representation |
---|---|
bin | 10011000111001110… |
… | …000100001011011101 |
3 | 1221222020011220120110 |
4 | 103013032010023131 |
5 | 314012142103201 |
6 | 13232222240233 |
7 | 1324363003620 |
oct | 230716041335 |
9 | 57866156513 |
10 | 20522222301 |
11 | 87812943a9 |
12 | 3b88a26079 |
13 | 1c20940809 |
14 | dc97c3db7 |
15 | 801a236d6 |
hex | 4c73842dd |
20522222301 has 32 divisors (see below), whose sum is σ = 32354713600. Its totient is φ = 11322685440.
The previous prime is 20522222261. The next prime is 20522222311. The reversal of 20522222301 is 10322222502.
It is not a de Polignac number, because 20522222301 - 27 = 20522222173 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20522222311) 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 31 ways as a sum of consecutive naturals, for example, 249885 + ... + 321693.
It is an arithmetic number, because the mean of its divisors is an integer number (1011084800).
Almost surely, 220522222301 is an apocalyptic number.
20522222301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20522222301 is a deficient number, since it is larger than the sum of its proper divisors (11832491299).
20522222301 is a wasteful number, since it uses less digits than its factorization.
20522222301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72289.
The product of its (nonzero) digits is 960, while the sum is 21.
Adding to 20522222301 its reverse (10322222502), we get a palindrome (30844444803).
The spelling of 20522222301 in words is "twenty billion, five hundred twenty-two million, two hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •