Base | Representation |
---|---|
bin | 1111101101001110… |
… | …1111011000000000 |
3 | 101212211121222220122 |
4 | 3323103233120000 |
5 | 32113330143000 |
6 | 1534212555412 |
7 | 206324404355 |
oct | 37323573000 |
9 | 11784558818 |
10 | 4216256000 |
11 | 1873a6a5a0 |
12 | 998022b68 |
13 | 52267ac48 |
14 | 2bdd6862c |
15 | 19a241085 |
hex | fb4ef600 |
4216256000 has 320 divisors, whose sum is σ = 11789084736. Its totient is φ = 1490944000.
The previous prime is 4216255997. The next prime is 4216256189. The reversal of 4216256000 is 6526124.
It is a tau number, because it is divible by the number of its divisors (320).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37311944 + ... + 37312056.
Almost surely, 24216256000 is an apocalyptic number.
4216256000 is a gapful number since it is divisible by the number (40) 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 4216256000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5894542368).
4216256000 is an abundant number, since it is smaller than the sum of its proper divisors (7572828736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4216256000 is a wasteful number, since it uses less digits than its factorization.
4216256000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210 (or 184 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 4216256000 is about 64932.7036245989. The cubic root of 4216256000 is about 1615.5075452701.
The spelling of 4216256000 in words is "four billion, two hundred sixteen million, two hundred fifty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •