Base | Representation |
---|---|
bin | 1011100001001… |
… | …1011001111100 |
3 | 10100220121022200 |
4 | 2320103121330 |
5 | 44332021410 |
6 | 4443311500 |
7 | 1124443041 |
oct | 270233174 |
9 | 110817280 |
10 | 48313980 |
11 | 252aa010 |
12 | 1421b590 |
13 | a017b70 |
14 | 65b91c8 |
15 | 43953c0 |
hex | 2e1367c |
48313980 has 144 divisors (see below), whose sum is σ = 172265184. Its totient is φ = 10805760.
The previous prime is 48313973. The next prime is 48313981. The reversal of 48313980 is 8931384.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48313981) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24802 + ... + 26678.
It is an arithmetic number, because the mean of its divisors is an integer number (1196286).
Almost surely, 248313980 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48313980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86132592).
48313980 is an abundant number, since it is smaller than the sum of its proper divisors (123951204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48313980 is a wasteful number, since it uses less digits than its factorization.
48313980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1916 (or 1911 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 48313980 is about 6950.8258502138. The cubic root of 48313980 is about 364.2148130262.
It can be divided in two parts, 48 and 313980, that added together give a triangular number (314028 = T792).
The spelling of 48313980 in words is "forty-eight million, three hundred thirteen thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •