Base | Representation |
---|---|
bin | 1000011011110010… |
… | …0010010010110000 |
3 | 12211210010221011020 |
4 | 2012330202102300 |
5 | 14114042003143 |
6 | 1012353415440 |
7 | 110050550610 |
oct | 20674422260 |
9 | 5753127136 |
10 | 2264016048 |
11 | a61a83848 |
12 | 53226a580 |
13 | 2a1086588 |
14 | 176982a40 |
15 | d3b64883 |
hex | 86f224b0 |
2264016048 has 160 divisors (see below), whose sum is σ = 6874560000. Its totient is φ = 628604928.
The previous prime is 2264016019. The next prime is 2264016059. The reversal of 2264016048 is 8406104622.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5042128 + ... + 5042576.
It is an arithmetic number, because the mean of its divisors is an integer number (42966000).
Almost surely, 22264016048 is an apocalyptic number.
2264016048 is a gapful number since it is divisible by the number (28) 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 2264016048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3437280000).
2264016048 is an abundant number, since it is smaller than the sum of its proper divisors (4610543952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2264016048 is a wasteful number, since it uses less digits than its factorization.
2264016048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 859 (or 853 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 33.
The square root of 2264016048 is about 47581.6776501207. The cubic root of 2264016048 is about 1313.0859879875.
The spelling of 2264016048 in words is "two billion, two hundred sixty-four million, sixteen thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •