Base | Representation |
---|---|
bin | 10111111010110111001110… |
… | …101001110111010000000011 |
3 | 111210111000211220212210200211 |
4 | 113322313032221313100003 |
5 | 102242044301332433020 |
6 | 1011424131555254551 |
7 | 31105312400644636 |
oct | 2772671651672003 |
9 | 453430756783624 |
10 | 105200101061635 |
11 | 3057a126540a48 |
12 | b970598baa457 |
13 | 4691433452158 |
14 | 1bd99d7c65c1d |
15 | c2676927985a |
hex | 5fadcea77403 |
105200101061635 has 8 divisors (see below), whose sum is σ = 127161582014016. Its totient is φ = 83545773689280.
The previous prime is 105200101061633. The next prime is 105200101061639. The reversal of 105200101061635 is 536160101002501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105200101061635 - 21 = 105200101061633 is a prime.
It is a super-2 number, since 2×1052001010616352 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105200101061597 and 105200101061606.
It is not an unprimeable number, because it can be changed into a prime (105200101061633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76788394251 + ... + 76788395620.
It is an arithmetic number, because the mean of its divisors is an integer number (15895197751752).
Almost surely, 2105200101061635 is an apocalyptic number.
105200101061635 is a deficient number, since it is larger than the sum of its proper divisors (21961480952381).
105200101061635 is a wasteful number, since it uses less digits than its factorization.
105200101061635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153576790013.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 105200101061635 in words is "one hundred five trillion, two hundred billion, one hundred one million, sixty-one thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •