Base | Representation |
---|---|
bin | 1011011101110111… |
… | …10110011110000000 |
3 | 120220000212212002212 |
4 | 11232323312132000 |
5 | 100101433310111 |
6 | 2454511401252 |
7 | 305361263045 |
oct | 55673663600 |
9 | 16800785085 |
10 | 6156150656 |
11 | 2679a94117 |
12 | 1239823228 |
13 | 77153c3c6 |
14 | 4258591cc |
15 | 2606ce98b |
hex | 16eef6780 |
6156150656 has 64 divisors (see below), whose sum is σ = 12607554960. Its totient is φ = 2992435200.
The previous prime is 6156150641. The next prime is 6156150691. The reversal of 6156150656 is 6560516516.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1609226 + ... + 1613046.
Almost surely, 26156150656 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 6156150656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6303777480).
6156150656 is an abundant number, since it is smaller than the sum of its proper divisors (6451404304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6156150656 is a wasteful number, since it uses less digits than its factorization.
6156150656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4183 (or 4171 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 41.
The square root of 6156150656 is about 78461.1410572138. The cubic root of 6156150656 is about 1832.7493740225.
The spelling of 6156150656 in words is "six billion, one hundred fifty-six million, one hundred fifty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •