Base | Representation |
---|---|
bin | 10010101110100101… |
… | …011001100100101010 |
3 | 1220220102110102002120 |
4 | 102232211121210222 |
5 | 312140340040332 |
6 | 13123215412110 |
7 | 1311213622251 |
oct | 225645314452 |
9 | 56812412076 |
10 | 20108908842 |
11 | 8589a55930 |
12 | 3a92524036 |
13 | 1b8611a439 |
14 | d8a955798 |
15 | 7ca5d032c |
hex | 4ae95992a |
20108908842 has 16 divisors (see below), whose sum is σ = 43873983072. Its totient is φ = 6093608720.
The previous prime is 20108908829. The next prime is 20108908843. The reversal of 20108908842 is 24880980102.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 20108908794 and 20108908803.
It is not an unprimeable number, because it can be changed into a prime (20108908843) 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, 152340153 + ... + 152340284.
It is an arithmetic number, because the mean of its divisors is an integer number (2742123942).
Almost surely, 220108908842 is an apocalyptic number.
20108908842 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20108908842 is an abundant number, since it is smaller than the sum of its proper divisors (23765074230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20108908842 is a wasteful number, since it uses less digits than its factorization.
20108908842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304680453.
The product of its (nonzero) digits is 73728, while the sum is 42.
The spelling of 20108908842 in words is "twenty billion, one hundred eight million, nine hundred eight thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •