Base | Representation |
---|---|
bin | 1001001001011110010011… |
… | …00100000101010001000001 |
3 | 2122020010202100112221211102 |
4 | 10210233021210011101001 |
5 | 10114043012130320322 |
6 | 110441253550024145 |
7 | 4144245625436261 |
oct | 444571144052101 |
9 | 78203670487742 |
10 | 20116713526337 |
11 | 64564a538691a |
12 | 230a9067a8055 |
13 | b2bcc864371c |
14 | 4d7922d097a1 |
15 | 24d43655b792 |
hex | 124bc9905441 |
20116713526337 has 48 divisors (see below), whose sum is σ = 21604949424000. Its totient is φ = 18724633691904.
The previous prime is 20116713526319. The next prime is 20116713526363. The reversal of 20116713526337 is 73362531761102.
It is not a de Polignac number, because 20116713526337 - 232 = 20112418559041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20116713526291 and 20116713526300.
It is not an unprimeable number, because it can be changed into a prime (20116713526237) 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 47 ways as a sum of consecutive naturals, for example, 9639056708 + ... + 9639058794.
It is an arithmetic number, because the mean of its divisors is an integer number (450103113000).
Almost surely, 220116713526337 is an apocalyptic number.
It is an amenable number.
20116713526337 is a deficient number, since it is larger than the sum of its proper divisors (1488235897663).
20116713526337 is a wasteful number, since it uses less digits than its factorization.
20116713526337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3430 (or 3411 counting only the distinct ones).
The product of its (nonzero) digits is 952560, while the sum is 47.
The spelling of 20116713526337 in words is "twenty trillion, one hundred sixteen billion, seven hundred thirteen million, five hundred twenty-six thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •