Base | Representation |
---|---|
bin | 10010101111000010… |
… | …001011111011011111 |
3 | 1220220221122210122220 |
4 | 102233002023323133 |
5 | 312144303031020 |
6 | 13124045240423 |
7 | 1311335022150 |
oct | 225702137337 |
9 | 56827583586 |
10 | 20116455135 |
11 | 859323a537 |
12 | 3a94b63113 |
13 | 1b878601ba |
14 | d8b95b927 |
15 | 7cb0c1240 |
hex | 4af08bedf |
20116455135 has 32 divisors (see below), whose sum is σ = 36844111872. Its totient is φ = 9181159680.
The previous prime is 20116455131. The next prime is 20116455157. The reversal of 20116455135 is 53155461102.
It is not a de Polignac number, because 20116455135 - 22 = 20116455131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20116455096 and 20116455105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20116455131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90471 + ... + 220040.
It is an arithmetic number, because the mean of its divisors is an integer number (1151378496).
Almost surely, 220116455135 is an apocalyptic number.
20116455135 is a deficient number, since it is larger than the sum of its proper divisors (16727656737).
20116455135 is a wasteful number, since it uses less digits than its factorization.
20116455135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311143.
The product of its (nonzero) digits is 18000, while the sum is 33.
The spelling of 20116455135 in words is "twenty billion, one hundred sixteen million, four hundred fifty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •