Base | Representation |
---|---|
bin | 1011011101001… |
… | …0011110101111 |
3 | 10100102002112022 |
4 | 2313102132233 |
5 | 44300014142 |
6 | 4433500355 |
7 | 1122254525 |
oct | 267223657 |
9 | 110362468 |
10 | 48048047 |
11 | 25138233 |
12 | 141116bb |
13 | 9c53ac8 |
14 | 654a315 |
15 | 43416d2 |
hex | 2dd27af |
48048047 has 4 divisors (see below), whose sum is σ = 49598016. Its totient is φ = 46498080.
The previous prime is 48047971. The next prime is 48048059. The reversal of 48048047 is 74084084.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 48048047 - 214 = 48031663 is a prime.
It is a super-2 number, since 2×480480472 = 4617229641028418, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 48047998 and 48048016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48048097) 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 3 ways as a sum of consecutive naturals, for example, 774938 + ... + 774999.
It is an arithmetic number, because the mean of its divisors is an integer number (12399504).
Almost surely, 248048047 is an apocalyptic number.
48048047 is a deficient number, since it is larger than the sum of its proper divisors (1549969).
48048047 is a wasteful number, since it uses less digits than its factorization.
48048047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549968.
The product of its (nonzero) digits is 28672, while the sum is 35.
The square root of 48048047 is about 6931.6698565353. The cubic root of 48048047 is about 363.5453381198.
It can be divided in two parts, 480480 and 47, that multiplied together give a triangular number (22582560 = T6720).
The spelling of 48048047 in words is "forty-eight million, forty-eight thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •