Base | Representation |
---|---|
bin | 10010101001011001… |
… | …111010000011111110 |
3 | 1220200100221111110000 |
4 | 102221121322003332 |
5 | 312001113310420 |
6 | 13110433055130 |
7 | 1306110164214 |
oct | 225131720376 |
9 | 56610844400 |
10 | 20022010110 |
11 | 85449a25a3 |
12 | 3a693b74a6 |
13 | 1b71112c7b |
14 | d7d1b4cb4 |
15 | 7c2b67690 |
hex | 4a967a0fe |
20022010110 has 80 divisors (see below), whose sum is σ = 55150148592. Its totient is φ = 5208969600.
The previous prime is 20022010091. The next prime is 20022010111. The reversal of 20022010110 is 1101022002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20022010092 and 20022010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022010111) 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 39 ways as a sum of consecutive naturals, for example, 268236 + ... + 334655.
Almost surely, 220022010110 is an apocalyptic number.
20022010110 is an abundant number, since it is smaller than the sum of its proper divisors (35128138482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022010110 is a wasteful number, since it uses less digits than its factorization.
20022010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602951 (or 602942 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20022010110 its reverse (1101022002), we get a palindrome (21123032112).
The spelling of 20022010110 in words is "twenty billion, twenty-two million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •