Base | Representation |
---|---|
bin | 10010101001011001… |
… | …111010000100000000 |
3 | 1220200100221111110002 |
4 | 102221121322010000 |
5 | 312001113310422 |
6 | 13110433055132 |
7 | 1306110164216 |
oct | 225131720400 |
9 | 56610844402 |
10 | 20022010112 |
11 | 85449a25a5 |
12 | 3a693b74a8 |
13 | 1b71112c80 |
14 | d7d1b4cb6 |
15 | 7c2b67692 |
hex | 4a967a100 |
20022010112 has 36 divisors (see below), whose sum is σ = 43040109420. Its totient is φ = 9240926208.
The previous prime is 20022010111. The next prime is 20022010159. The reversal of 20022010112 is 21101022002.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 4669808896 + 15352201216 = 68336^2 + 123904^2 .
It is a junction number, because it is equal to n+sod(n) for n = 20022010093 and 20022010102.
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 (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3004787 + ... + 3011442.
It is an arithmetic number, because the mean of its divisors is an integer number (1195558595).
Almost surely, 220022010112 is an apocalyptic number.
It is an amenable number.
20022010112 is an abundant number, since it is smaller than the sum of its proper divisors (23018099308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022010112 is an equidigital number, since it uses as much as digits as its factorization.
20022010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6016258 (or 6016244 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20022010112 its reverse (21101022002), we get a palindrome (41123032114).
The spelling of 20022010112 in words is "twenty billion, twenty-two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •