Base | Representation |
---|---|
bin | 1001010011010001… |
… | …01100001110010000 |
3 | 110220000011002022020 |
4 | 10221220230032100 |
5 | 40211314000143 |
6 | 2143300011440 |
7 | 234513023115 |
oct | 45150541620 |
9 | 13800132266 |
10 | 4993500048 |
11 | 2132778549 |
12 | b74390b80 |
13 | 6176c4174 |
14 | 35528c90c |
15 | 1e35c0883 |
hex | 129a2c390 |
4993500048 has 40 divisors (see below), whose sum is σ = 13578818400. Its totient is φ = 1576894464.
The previous prime is 4993500041. The next prime is 4993500059. The reversal of 4993500048 is 8400053994.
It is a junction number, because it is equal to n+sod(n) for n = 4993499982 and 4993500009.
It is not an unprimeable number, because it can be changed into a prime (4993500041) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2736753 + ... + 2738576.
It is an arithmetic number, because the mean of its divisors is an integer number (339470460).
Almost surely, 24993500048 is an apocalyptic number.
4993500048 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4993500048 is an abundant number, since it is smaller than the sum of its proper divisors (8585318352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4993500048 is a wasteful number, since it uses less digits than its factorization.
4993500048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5475359 (or 5475353 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The square root of 4993500048 is about 70664.7015701616. The cubic root of 4993500048 is about 1709.2346412489.
The spelling of 4993500048 in words is "four billion, nine hundred ninety-three million, five hundred thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •