Base | Representation |
---|---|
bin | 1001001101011000100111… |
… | …10101110001101101110101 |
3 | 2122200222122020022100112222 |
4 | 10212230103311301231311 |
5 | 10123243230014240023 |
6 | 111023121213052125 |
7 | 4160044140660614 |
oct | 446542365615565 |
9 | 78628566270488 |
10 | 20251103665013 |
11 | 64a849908a131 |
12 | 2330971787045 |
13 | b3b894c07840 |
14 | 50023148387b |
15 | 251b9ea0bcc8 |
hex | 126b13d71b75 |
20251103665013 has 16 divisors (see below), whose sum is σ = 21890871363312. Its totient is φ = 18623075520000.
The previous prime is 20251103664991. The next prime is 20251103665021. The reversal of 20251103665013 is 31056630115202.
It can be written as a sum of positive squares in 8 ways, for example, as 137609837764 + 20113493827249 = 370958^2 + 4484807^2 .
It is a cyclic number.
It is not a de Polignac number, because 20251103665013 - 224 = 20251086887797 is a prime.
It is a super-2 number, since 2×202511036650132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20251103665073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17789663 + ... + 18893763.
It is an arithmetic number, because the mean of its divisors is an integer number (1368179460207).
Almost surely, 220251103665013 is an apocalyptic number.
It is an amenable number.
20251103665013 is a deficient number, since it is larger than the sum of its proper divisors (1639767698299).
20251103665013 is a wasteful number, since it uses less digits than its factorization.
20251103665013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1109416.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 20251103665013 in words is "twenty trillion, two hundred fifty-one billion, one hundred three million, six hundred sixty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •