Base | Representation |
---|---|
bin | 1011100011111… |
… | …0100110000001 |
3 | 10101020120222120 |
4 | 2320332212001 |
5 | 44403202011 |
6 | 4451154453 |
7 | 1126110555 |
oct | 270764601 |
9 | 111216876 |
10 | 48490881 |
11 | 2540aa0a |
12 | 142a5a29 |
13 | a07a53a |
14 | 6623865 |
15 | 43cca06 |
hex | 2e3e981 |
48490881 has 4 divisors (see below), whose sum is σ = 64654512. Its totient is φ = 32327252.
The previous prime is 48490873. The next prime is 48490901. The reversal of 48490881 is 18809484.
48490881 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 48490881 - 23 = 48490873 is a prime.
It is a super-2 number, since 2×484908812 = 4702731080312322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (48490801) 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, 8081811 + ... + 8081816.
It is an arithmetic number, because the mean of its divisors is an integer number (16163628).
Almost surely, 248490881 is an apocalyptic number.
It is an amenable number.
48490881 is a deficient number, since it is larger than the sum of its proper divisors (16163631).
48490881 is a wasteful number, since it uses less digits than its factorization.
48490881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16163630.
The product of its (nonzero) digits is 73728, while the sum is 42.
The square root of 48490881 is about 6963.5394017698. The cubic root of 48490881 is about 364.6587941659.
The spelling of 48490881 in words is "forty-eight million, four hundred ninety thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •