Base | Representation |
---|---|
bin | 1011010111111001… |
… | …11111000000000000 |
3 | 120202112201211121000 |
4 | 11223330333000000 |
5 | 100001131203341 |
6 | 2445523132000 |
7 | 304213062513 |
oct | 55374770000 |
9 | 16675654530 |
10 | 6106116096 |
11 | 265381a443 |
12 | 1224b14000 |
13 | 764071362 |
14 | 41cd52d7a |
15 | 25b0e98b6 |
hex | 16bf3f000 |
6106116096 has 104 divisors (see below), whose sum is σ = 18090314960. Its totient is φ = 2035335168.
The previous prime is 6106116091. The next prime is 6106116109. The reversal of 6106116096 is 6906116016.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 6106116096.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6106116091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82986 + ... + 138198.
Almost surely, 26106116096 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 6106116096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9045157480).
6106116096 is an abundant number, since it is smaller than the sum of its proper divisors (11984198864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6106116096 is an equidigital number, since it uses as much as digits as its factorization.
6106116096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55246 (or 55218 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 36.
The square root of 6106116096 is about 78141.6412420420. The cubic root of 6106116096 is about 1827.7705933676.
The spelling of 6106116096 in words is "six billion, one hundred six million, one hundred sixteen thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •