Base | Representation |
---|---|
bin | 1011101010010… |
… | …0001011010000 |
3 | 10102000201201220 |
4 | 2322210023100 |
5 | 100010010320 |
6 | 4504125040 |
7 | 1132462614 |
oct | 272441320 |
9 | 112021656 |
10 | 48906960 |
11 | 25674583 |
12 | 14466780 |
13 | a194a3b |
14 | 66d1344 |
15 | 4460e40 |
hex | 2ea42d0 |
48906960 has 80 divisors (see below), whose sum is σ = 160543296. Its totient is φ = 12273664.
The previous prime is 48906959. The next prime is 48906967. The reversal of 48906960 is 6960984.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48906967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1914 + ... + 10073.
Almost surely, 248906960 is an apocalyptic number.
48906960 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 48906960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80271648).
48906960 is an abundant number, since it is smaller than the sum of its proper divisors (111636336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48906960 is a wasteful number, since it uses less digits than its factorization.
48906960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12020 (or 12014 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 42.
The square root of 48906960 is about 6993.3511280358. The cubic root of 48906960 is about 365.6988175889.
The spelling of 48906960 in words is "forty-eight million, nine hundred six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •