Base | Representation |
---|---|
bin | 1011100101110… |
… | …0111111011110 |
3 | 10101110220210000 |
4 | 2321130333132 |
5 | 44421143030 |
6 | 4453555130 |
7 | 1130136555 |
oct | 271347736 |
9 | 111426700 |
10 | 48615390 |
11 | 2549550a |
12 | 14345aa6 |
13 | a0c2105 |
14 | 6656d9c |
15 | 4404860 |
hex | 2e5cfde |
48615390 has 80 divisors (see below), whose sum is σ = 133607232. Its totient is φ = 12678336.
The previous prime is 48615377. The next prime is 48615403. The reversal of 48615390 is 9351684.
48615390 is a `hidden beast` number, since 4 + 8 + 615 + 39 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (48615377) and next prime (48615403).
It is a super-2 number, since 2×486153902 = 4726912289704200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 37432 + ... + 38708.
Almost surely, 248615390 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48615390, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66803616).
48615390 is an abundant number, since it is smaller than the sum of its proper divisors (84991842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48615390 is a wasteful number, since it uses less digits than its factorization.
48615390 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1343 (or 1334 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 48615390 is about 6972.4737360567. The cubic root of 48615390 is about 364.9706362817.
It can be divided in two parts, 486 and 15390, that added together give a square (15876 = 1262).
The spelling of 48615390 in words is "forty-eight million, six hundred fifteen thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •