Base | Representation |
---|---|
bin | 1011100100111… |
… | …0101010101000 |
3 | 10101100221021202 |
4 | 2321032222220 |
5 | 44412303322 |
6 | 4452423332 |
7 | 1126503521 |
oct | 271165250 |
9 | 111327252 |
10 | 48556712 |
11 | 25455416 |
12 | 14317b48 |
13 | a0a14a9 |
14 | 663d848 |
15 | 43e2292 |
hex | 2e4eaa8 |
48556712 has 16 divisors (see below), whose sum is σ = 91197600. Its totient is φ = 24237360.
The previous prime is 48556699. The next prime is 48556727. The reversal of 48556712 is 21765584.
48556712 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3 ways as a sum of consecutive naturals, for example, 239 + ... + 9857.
It is an arithmetic number, because the mean of its divisors is an integer number (5699850).
Almost surely, 248556712 is an apocalyptic number.
It is an amenable number.
48556712 is a deficient number, since it is larger than the sum of its proper divisors (42640888).
48556712 is a wasteful number, since it uses less digits than its factorization.
48556712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10256 (or 10252 counting only the distinct ones).
The product of its digits is 67200, while the sum is 38.
The square root of 48556712 is about 6968.2646333216. The cubic root of 48556712 is about 364.8237392536.
The spelling of 48556712 in words is "forty-eight million, five hundred fifty-six thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •