Base | Representation |
---|---|
bin | 1100100110111110… |
… | …01100100110010100 |
3 | 122110202210221201200 |
4 | 12103133030212110 |
5 | 102330431133431 |
6 | 3035415352500 |
7 | 326515626510 |
oct | 62337144624 |
9 | 18422727650 |
10 | 6769396116 |
11 | 296416954a |
12 | 138b082730 |
13 | 83b5c4b42 |
14 | 48308d140 |
15 | 299466ee6 |
hex | 1937cc994 |
6769396116 has 72 divisors (see below), whose sum is σ = 19585413120. Its totient is φ = 1931207616.
The previous prime is 6769396111. The next prime is 6769396147. The reversal of 6769396116 is 6116939676.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6769396111) 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 23 ways as a sum of consecutive naturals, for example, 150765 + ... + 190443.
Almost surely, 26769396116 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6769396116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9792706560).
6769396116 is an abundant number, since it is smaller than the sum of its proper divisors (12816017004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6769396116 is a wasteful number, since it uses less digits than its factorization.
6769396116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40373 (or 40368 counting only the distinct ones).
The product of its digits is 2204496, while the sum is 54.
The square root of 6769396116 is about 82276.3399526255. The cubic root of 6769396116 is about 1891.6900344732.
The spelling of 6769396116 in words is "six billion, seven hundred sixty-nine million, three hundred ninety-six thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •