Base | Representation |
---|---|
bin | 1011011111000… |
… | …0111100000001 |
3 | 10100122102122211 |
4 | 2313300330001 |
5 | 44313012201 |
6 | 4440302121 |
7 | 1123314325 |
oct | 267607401 |
9 | 110572584 |
10 | 48172801 |
11 | 25212a36 |
12 | 14171941 |
13 | 9c98821 |
14 | 657d985 |
15 | 4368651 |
hex | 2df0f01 |
48172801 has 4 divisors (see below), whose sum is σ = 48211632. Its totient is φ = 48133972.
The previous prime is 48172783. The next prime is 48172807. The reversal of 48172801 is 10827184.
48172801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 48172801 - 211 = 48170753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48172807) 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 3 ways as a sum of consecutive naturals, for example, 17491 + ... + 20056.
It is an arithmetic number, because the mean of its divisors is an integer number (12052908).
Almost surely, 248172801 is an apocalyptic number.
It is an amenable number.
48172801 is a deficient number, since it is larger than the sum of its proper divisors (38831).
48172801 is a wasteful number, since it uses less digits than its factorization.
48172801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38830.
The product of its (nonzero) digits is 3584, while the sum is 31.
The square root of 48172801 is about 6940.6628645973. The cubic root of 48172801 is about 363.8597077399.
Adding to 48172801 its reverse (10827184), we get a palindrome (58999985).
The spelling of 48172801 in words is "forty-eight million, one hundred seventy-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •