Base | Representation |
---|---|
bin | 1001000011101100… |
… | …01100010100000000 |
3 | 110112220020221012220 |
4 | 10201312030110000 |
5 | 34424340243012 |
6 | 2122311051040 |
7 | 231335205354 |
oct | 44166142400 |
9 | 13486227186 |
10 | 4862821632 |
11 | 2075a32959 |
12 | b38670a80 |
13 | 5c65cb966 |
14 | 341b93464 |
15 | 1d6dab08c |
hex | 121d8c500 |
4862821632 has 72 divisors (see below), whose sum is σ = 12972319584. Its totient is φ = 1617168384.
The previous prime is 4862821619. The next prime is 4862821633. The reversal of 4862821632 is 2361282684.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4862821633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333078 + ... + 347370.
Almost surely, 24862821632 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 4862821632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6486159792).
4862821632 is an abundant number, since it is smaller than the sum of its proper divisors (8109497952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4862821632 is a wasteful number, since it uses less digits than its factorization.
4862821632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14755 (or 14741 counting only the distinct ones).
The product of its digits is 221184, while the sum is 42.
The square root of 4862821632 is about 69733.9345799446. The cubic root of 4862821632 is about 1694.1925981182.
The spelling of 4862821632 in words is "four billion, eight hundred sixty-two million, eight hundred twenty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •