Base | Representation |
---|---|
bin | 11001000000100111000000 |
3 | 110100002021101 |
4 | 121000213000 |
5 | 3134243341 |
6 | 352304144 |
7 | 106503661 |
oct | 31004700 |
9 | 13302241 |
10 | 6556096 |
11 | 3778768 |
12 | 2242054 |
13 | 1487161 |
14 | c29368 |
15 | 897831 |
hex | 6409c0 |
6556096 has 28 divisors (see below), whose sum is σ = 13167360. Its totient is φ = 3238400.
The previous prime is 6556079. The next prime is 6556111. The reversal of 6556096 is 6906556.
It is a happy number.
It is a super-2 number, since 2×65560962 = 85964789522432, which contains 22 as substring.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5121 + ... + 6271.
Almost surely, 26556096 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 6556096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6583680).
6556096 is an abundant number, since it is smaller than the sum of its proper divisors (6611264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6556096 is a wasteful number, since it uses less digits than its factorization.
6556096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252 (or 1242 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 37.
The square root of 6556096 is about 2560.4874535916. The cubic root of 6556096 is about 187.1608898743.
It can be divided in two parts, 65560 and 96, that added together give a palindrome (65656).
The spelling of 6556096 in words is "six million, five hundred fifty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •