Base | Representation |
---|---|
bin | 1011100100101… |
… | …0100010010111 |
3 | 10101100002002100 |
4 | 2321022202113 |
5 | 44411233144 |
6 | 4452213143 |
7 | 1126403310 |
oct | 271124227 |
9 | 111302070 |
10 | 48539799 |
11 | 25443740 |
12 | 1430a1b3 |
13 | a096899 |
14 | 6637607 |
15 | 43dc269 |
hex | 2e4a897 |
48539799 has 48 divisors (see below), whose sum is σ = 88508160. Its totient is φ = 24900480.
The previous prime is 48539797. The next prime is 48539807. The reversal of 48539799 is 99793584.
48539799 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 48539799 - 21 = 48539797 is a prime.
It is a super-2 number, since 2×485397992 = 4712224173920802, which contains 22 as substring.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48539797) 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 47 ways as a sum of consecutive naturals, for example, 61284 + ... + 62070.
It is an arithmetic number, because the mean of its divisors is an integer number (1843920).
Almost surely, 248539799 is an apocalyptic number.
48539799 is a deficient number, since it is larger than the sum of its proper divisors (39968361).
48539799 is a wasteful number, since it uses less digits than its factorization.
48539799 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 900 (or 897 counting only the distinct ones).
The product of its digits is 2449440, while the sum is 54.
The square root of 48539799 is about 6967.0509543135. The cubic root of 48539799 is about 364.7813765524.
The spelling of 48539799 in words is "forty-eight million, five hundred thirty-nine thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •