[go: up one dir, main page]

Search a number
-
+
48513 = 3103157
BaseRepresentation
bin1011110110000001
32110112210
423312001
53023023
61012333
7261303
oct136601
973483
1048513
11334a3
12240a9
131910a
1413973
15e593
hexbd81

48513 has 8 divisors (see below), whose sum is σ = 65728. Its totient is φ = 31824.

The previous prime is 48497. The next prime is 48523. The reversal of 48513 is 31584.

48513 is digitally balanced in base 2 and base 4, because in such bases 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 not a de Polignac number, because 48513 - 24 = 48497 is a prime.

It is a super-2 number, since 2×485132 = 4707022338, which contains 22 as substring.

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 48513.

It is not an unprimeable number, because it can be changed into a prime (48523) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 231 + ... + 387.

It is an arithmetic number, because the mean of its divisors is an integer number (8216).

248513 is an apocalyptic number.

It is an amenable number.

48513 is a deficient number, since it is larger than the sum of its proper divisors (17215).

48513 is a wasteful number, since it uses less digits than its factorization.

48513 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 263.

The product of its digits is 480, while the sum is 21.

The square root of 48513 is about 220.2566684575. The cubic root of 48513 is about 36.4714231818.

It can be divided in two parts, 48 and 513, that added together give a triangular number (561 = T33).

The spelling of 48513 in words is "forty-eight thousand, five hundred thirteen".

Divisors: 1 3 103 157 309 471 16171 48513