Base | Representation |
---|---|
bin | 1011100010110111… |
… | …00001100100100111 |
3 | 120222221122102201200 |
4 | 11301123201210213 |
5 | 100143142224403 |
6 | 2503004453543 |
7 | 306410125320 |
oct | 56133414447 |
9 | 16887572650 |
10 | 6198008103 |
11 | 26a0683251 |
12 | 124b84a2b3 |
13 | 77a106521 |
14 | 42b233447 |
15 | 2641ebca3 |
hex | 1716e1927 |
6198008103 has 12 divisors (see below), whose sum is σ = 10231632528. Its totient is φ = 3541718880.
The previous prime is 6198008101. The next prime is 6198008137. The reversal of 6198008103 is 3018008916.
It is not a de Polignac number, because 6198008103 - 21 = 6198008101 is a prime.
It is a super-3 number, since 3×61980081033 (a number of 30 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6198008101) 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 11 ways as a sum of consecutive naturals, for example, 49190478 + ... + 49190603.
It is an arithmetic number, because the mean of its divisors is an integer number (852636044).
Almost surely, 26198008103 is an apocalyptic number.
6198008103 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
6198008103 is a deficient number, since it is larger than the sum of its proper divisors (4033624425).
6198008103 is a wasteful number, since it uses less digits than its factorization.
6198008103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98381094 (or 98381091 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 36.
The square root of 6198008103 is about 78727.4291654440. The cubic root of 6198008103 is about 1836.8937926431.
The spelling of 6198008103 in words is "six billion, one hundred ninety-eight million, eight thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •