Base | Representation |
---|---|
bin | 1011011110100… |
… | …1000100100101 |
3 | 10100120210110111 |
4 | 2313221010211 |
5 | 44310444311 |
6 | 4435453021 |
7 | 1123121356 |
oct | 267510445 |
9 | 110523414 |
10 | 48140581 |
11 | 251a0805 |
12 | 14157171 |
13 | 9c86c68 |
14 | 6571d2d |
15 | 435dd21 |
hex | 2de9125 |
48140581 has 8 divisors (see below), whose sum is σ = 48857760. Its totient is φ = 47426832.
The previous prime is 48140579. The next prime is 48140591. The reversal of 48140581 is 18504184.
48140581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48140581 - 21 = 48140579 is a prime.
It is a super-2 number, since 2×481405812 = 4635031078035122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48140501) 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 7 ways as a sum of consecutive naturals, for example, 42855 + ... + 43963.
It is an arithmetic number, because the mean of its divisors is an integer number (6107220).
Almost surely, 248140581 is an apocalyptic number.
It is an amenable number.
48140581 is a deficient number, since it is larger than the sum of its proper divisors (717179).
48140581 is a wasteful number, since it uses less digits than its factorization.
48140581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1715.
The product of its (nonzero) digits is 5120, while the sum is 31.
The square root of 48140581 is about 6938.3413724031. The cubic root of 48140581 is about 363.7785680770.
The spelling of 48140581 in words is "forty-eight million, one hundred forty thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •