Base | Representation |
---|---|
bin | 1100110111111010… |
… | …00011100100101100 |
3 | 122211200002120221120 |
4 | 12123331003210230 |
5 | 103123312104241 |
6 | 3101452100540 |
7 | 333162165222 |
oct | 63375034454 |
9 | 18750076846 |
10 | 6911441196 |
11 | 2a27368080 |
12 | 140a764750 |
13 | 861b69c9a |
14 | 497ca6b12 |
15 | 2a6b74666 |
hex | 19bf4392c |
6911441196 has 192 divisors, whose sum is σ = 18827182080. Its totient is φ = 1953504000.
The previous prime is 6911441191. The next prime is 6911441231.
6911441196 is nontrivially palindromic in base 10.
It is not an unprimeable number, because it can be changed into a prime (6911441191) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28918045 + ... + 28918283.
It is an arithmetic number, because the mean of its divisors is an integer number (98058240).
Almost surely, 26911441196 is an apocalyptic number.
6911441196 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6911441196, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9413591040).
6911441196 is an abundant number, since it is smaller than the sum of its proper divisors (11915740884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6911441196 is a wasteful number, since it uses less digits than its factorization.
6911441196 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 516 (or 514 counting only the distinct ones).
The product of its digits is 46656, while the sum is 42.
The square root of 6911441196 is about 83135.0780116312. The cubic root of 6911441196 is about 1904.8299272945.
The spelling of 6911441196 in words is "six billion, nine hundred eleven million, four hundred forty-one thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •