Base | Representation |
---|---|
bin | 1011100001111… |
… | …1111110010101 |
3 | 10101000012221101 |
4 | 2320133332111 |
5 | 44340143321 |
6 | 4444350101 |
7 | 1125046114 |
oct | 270377625 |
9 | 111005841 |
10 | 48365461 |
11 | 25334761 |
12 | 14245331 |
13 | a035421 |
14 | 65cdc7b |
15 | 43a5791 |
hex | 2e1ff95 |
48365461 has 4 divisors (see below), whose sum is σ = 48864172. Its totient is φ = 47866752.
The previous prime is 48365453. The next prime is 48365479. The reversal of 48365461 is 16456384.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 29224836 + 19140625 = 5406^2 + 4375^2 .
It is a cyclic number.
It is not a de Polignac number, because 48365461 - 23 = 48365453 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 48365461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48365761) 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, 249210 + ... + 249403.
It is an arithmetic number, because the mean of its divisors is an integer number (12216043).
Almost surely, 248365461 is an apocalyptic number.
It is an amenable number.
48365461 is a deficient number, since it is larger than the sum of its proper divisors (498711).
48365461 is an equidigital number, since it uses as much as digits as its factorization.
48365461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498710.
The product of its digits is 69120, while the sum is 37.
The square root of 48365461 is about 6954.5280932641. The cubic root of 48365461 is about 364.3441302340.
The spelling of 48365461 in words is "forty-eight million, three hundred sixty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •