Base | Representation |
---|---|
bin | 1100100110101100… |
… | …01101101001010000 |
3 | 122110121101022021000 |
4 | 12103112031221100 |
5 | 102324330303404 |
6 | 3035253102000 |
7 | 326456620545 |
oct | 62326155120 |
9 | 18417338230 |
10 | 6767041104 |
11 | 296290015a |
12 | 138a327900 |
13 | 83ac7bc45 |
14 | 482a38bcc |
15 | 29914e339 |
hex | 19358da50 |
6767041104 has 80 divisors (see below), whose sum is σ = 19442059200. Its totient is φ = 2253573504.
The previous prime is 6767041093. The next prime is 6767041109. The reversal of 6767041104 is 4011407676.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6767041109) 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, 495682 + ... + 509150.
It is an arithmetic number, because the mean of its divisors is an integer number (243025740).
Almost surely, 26767041104 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 6767041104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9721029600).
6767041104 is an abundant number, since it is smaller than the sum of its proper divisors (12675018096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6767041104 is a wasteful number, since it uses less digits than its factorization.
6767041104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14649 (or 14637 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 36.
The square root of 6767041104 is about 82262.0271085025. The cubic root of 6767041104 is about 1891.4706417156.
The spelling of 6767041104 in words is "six billion, seven hundred sixty-seven million, forty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •