Base | Representation |
---|---|
bin | 1100100011101101… |
… | …00100000100001001 |
3 | 122101212012102012200 |
4 | 12101312210010021 |
5 | 102301420421423 |
6 | 3032555430413 |
7 | 326033526540 |
oct | 62166440411 |
9 | 18355172180 |
10 | 6741967113 |
11 | 294a734752 |
12 | 1381a55409 |
13 | 835a1016b |
14 | 47d58d157 |
15 | 296d49d43 |
hex | 191da4109 |
6741967113 has 12 divisors (see below), whose sum is σ = 11129596608. Its totient is φ = 3852552600.
The previous prime is 6741967031. The next prime is 6741967147. The reversal of 6741967113 is 3117691476.
6741967113 is a `hidden beast` number, since 67 + 419 + 67 + 113 = 666.
It is not a de Polignac number, because 6741967113 - 212 = 6741963017 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6741967153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53507613 + ... + 53507738.
It is an arithmetic number, because the mean of its divisors is an integer number (927466384).
Almost surely, 26741967113 is an apocalyptic number.
6741967113 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
It is an amenable number.
6741967113 is a deficient number, since it is larger than the sum of its proper divisors (4387629495).
6741967113 is a wasteful number, since it uses less digits than its factorization.
6741967113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107015364 (or 107015361 counting only the distinct ones).
The product of its digits is 190512, while the sum is 45.
The square root of 6741967113 is about 82109.4824791875. The cubic root of 6741967113 is about 1889.1315881121.
The spelling of 6741967113 in words is "six billion, seven hundred forty-one million, nine hundred sixty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •