Base | Representation |
---|---|
bin | 1011010111111001… |
… | …11100011011011000 |
3 | 120202112201022010210 |
4 | 11223330330123120 |
5 | 100001130334220 |
6 | 2445523011120 |
7 | 304213020012 |
oct | 55374743330 |
9 | 16675638123 |
10 | 6106105560 |
11 | 2653812535 |
12 | 1224b09aa0 |
13 | 764069619 |
14 | 41cd4d1b2 |
15 | 25b0e66e0 |
hex | 16bf3c6d8 |
6106105560 has 128 divisors (see below), whose sum is σ = 19920323520. Its totient is φ = 1491075072.
The previous prime is 6106105547. The next prime is 6106105561. The reversal of 6106105560 is 655016016.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6106105561) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35032 + ... + 115928.
Almost surely, 26106105560 is an apocalyptic number.
6106105560 is a gapful number since it is divisible by the number (60) 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 6106105560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9960161760).
6106105560 is an abundant number, since it is smaller than the sum of its proper divisors (13814217960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6106105560 is a wasteful number, since it uses less digits than its factorization.
6106105560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80965 (or 80961 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
The square root of 6106105560 is about 78141.5738259731. The cubic root of 6106105560 is about 1827.7695421046.
The spelling of 6106105560 in words is "six billion, one hundred six million, one hundred five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •