Base | Representation |
---|---|
bin | 10010101110010110… |
… | …101101000101100111 |
3 | 1220220011012200211111 |
4 | 102232112231011213 |
5 | 312133343302430 |
6 | 13123001045451 |
7 | 1311136106260 |
oct | 225626550547 |
9 | 56804180744 |
10 | 20105056615 |
11 | 8587864676 |
12 | 3a91186887 |
13 | 1b8539bc07 |
14 | d8a231967 |
15 | 7ca0bdc2a |
hex | 4ae5ad167 |
20105056615 has 16 divisors (see below), whose sum is σ = 27816660288. Its totient is φ = 13664318976.
The previous prime is 20105056607. The next prime is 20105056627. The reversal of 20105056615 is 51665050102.
It is not a de Polignac number, because 20105056615 - 23 = 20105056607 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2537772 + ... + 2545681.
It is an arithmetic number, because the mean of its divisors is an integer number (1738541268).
Almost surely, 220105056615 is an apocalyptic number.
20105056615 is a deficient number, since it is larger than the sum of its proper divisors (7711603673).
20105056615 is a wasteful number, since it uses less digits than its factorization.
20105056615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5083578.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 20105056615 in words is "twenty billion, one hundred five million, fifty-six thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •