Base | Representation |
---|---|
bin | 1000111101110101… |
… | …00101011110010000 |
3 | 110102110201022220211 |
4 | 10132322211132100 |
5 | 34324243012431 |
6 | 2113353013504 |
7 | 230200164400 |
oct | 43672453620 |
9 | 13373638824 |
10 | 4813641616 |
11 | 20501a2213 |
12 | b240b4294 |
13 | 5b936c864 |
14 | 339430800 |
15 | 1d28e42b1 |
hex | 11eea5790 |
4813641616 has 30 divisors (see below), whose sum is σ = 10849114950. Its totient is φ = 2062988928.
The previous prime is 4813641607. The next prime is 4813641617. The reversal of 4813641616 is 6161463184.
It can be written as a sum of positive squares in only one way, i.e., 3352873216 + 1460768400 = 57904^2 + 38220^2 .
It is a super-2 number, since 2×48136416162 = 46342291214574182912, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4813641617) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 3069141 + ... + 3070708.
It is an arithmetic number, because the mean of its divisors is an integer number (361637165).
Almost surely, 24813641616 is an apocalyptic number.
It is an amenable number.
4813641616 is an abundant number, since it is smaller than the sum of its proper divisors (6035473334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4813641616 is a wasteful number, since it uses less digits than its factorization.
4813641616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6139871 (or 6139858 counting only the distinct ones).
The product of its digits is 82944, while the sum is 40.
The square root of 4813641616 is about 69380.4123366242. The cubic root of 4813641616 is about 1688.4618447553.
The spelling of 4813641616 in words is "four billion, eight hundred thirteen million, six hundred forty-one thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •