Base | Representation |
---|---|
bin | 1011100001001… |
… | …0110101011000 |
3 | 10100220111010000 |
4 | 2320102311120 |
5 | 44331433030 |
6 | 4443253000 |
7 | 1124433156 |
oct | 270226530 |
9 | 110814100 |
10 | 48311640 |
11 | 252a8283 |
12 | 1421a160 |
13 | a016a90 |
14 | 65b83d6 |
15 | 4394860 |
hex | 2e12d58 |
48311640 has 320 divisors, whose sum is σ = 185391360. Its totient is φ = 11197440.
The previous prime is 48311639. The next prime is 48311663. The reversal of 48311640 is 4611384.
48311640 is a `hidden beast` number, since 4 + 8 + 3 + 11 + 640 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 1305702 + ... + 1305738.
It is an arithmetic number, because the mean of its divisors is an integer number (579348).
Almost surely, 248311640 is an apocalyptic number.
48311640 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 48311640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92695680).
48311640 is an abundant number, since it is smaller than the sum of its proper divisors (137079720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48311640 is a wasteful number, since it uses less digits than its factorization.
48311640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 48311640 is about 6950.6575228535. The cubic root of 48311640 is about 364.2089329033.
The spelling of 48311640 in words is "forty-eight million, three hundred eleven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •