Base | Representation |
---|---|
bin | 1000100101110010… |
… | …11011010100000000 |
3 | 102220102022110002000 |
4 | 10102321123110000 |
5 | 33421133330024 |
6 | 2041351224000 |
7 | 222201306660 |
oct | 42271332400 |
9 | 12812273060 |
10 | 4612011264 |
11 | 1a573a6363 |
12 | a88678000 |
13 | 586664463 |
14 | 31a7461a0 |
15 | 1bed66cc9 |
hex | 112e5b500 |
4612011264 has 288 divisors, whose sum is σ = 15697920000. Its totient is φ = 1308358656.
The previous prime is 4612011251. The next prime is 4612011307. The reversal of 4612011264 is 4621102164.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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, 9628177 + ... + 9628655.
Almost surely, 24612011264 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 4612011264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7848960000).
4612011264 is an abundant number, since it is smaller than the sum of its proper divisors (11085908736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4612011264 is a wasteful number, since it uses less digits than its factorization.
4612011264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710 (or 690 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 4612011264 is about 67911.7903165570. The cubic root of 4612011264 is about 1664.5497751918.
The spelling of 4612011264 in words is "four billion, six hundred twelve million, eleven thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •