Base | Representation |
---|---|
bin | 101101000100100110… |
… | …001110110011010000 |
3 | 11121220202200210021220 |
4 | 231010212032303100 |
5 | 1243103222404130 |
6 | 34122123445040 |
7 | 3332200034130 |
oct | 550446166320 |
9 | 147822623256 |
10 | 48395513040 |
11 | 19585007276 |
12 | 9467686780 |
13 | 4743525864 |
14 | 24b15ccac0 |
15 | 13d3aab410 |
hex | b4498ecd0 |
48395513040 has 320 divisors, whose sum is σ = 173553463296. Its totient is φ = 10927558656.
The previous prime is 48395513029. The next prime is 48395513041. The reversal of 48395513040 is 4031559384.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 48395512983 and 48395513001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48395513041) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 65134909 + ... + 65135651.
Almost surely, 248395513040 is an apocalyptic number.
48395513040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48395513040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86776731648).
48395513040 is an abundant number, since it is smaller than the sum of its proper divisors (125157950256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48395513040 is a wasteful number, since it uses less digits than its factorization.
48395513040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1186 (or 1180 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 48395513040 in words is "forty-eight billion, three hundred ninety-five million, five hundred thirteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •