Base | Representation |
---|---|
bin | 1011100110101… |
… | …1111011011100 |
3 | 10101121000201000 |
4 | 2321223323130 |
5 | 44430122242 |
6 | 4455150300 |
7 | 1130513130 |
oct | 271537334 |
9 | 111530630 |
10 | 48676572 |
11 | 2552747a |
12 | 14375390 |
13 | a113c09 |
14 | 66713c0 |
15 | 4417a4c |
hex | 2e6bedc |
48676572 has 144 divisors (see below), whose sum is σ = 151253760. Its totient is φ = 13258080.
The previous prime is 48676519. The next prime is 48676577. The reversal of 48676572 is 27567684.
48676572 is a `hidden beast` number, since 4 + 8 + 6 + 76 + 572 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48676577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 726483 + ... + 726549.
Almost surely, 248676572 is an apocalyptic number.
48676572 is a gapful number since it is divisible by the number (42) 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 48676572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75626880).
48676572 is an abundant number, since it is smaller than the sum of its proper divisors (102577188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48676572 is a wasteful number, since it uses less digits than its factorization.
48676572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149 (or 110 counting only the distinct ones).
The product of its digits is 564480, while the sum is 45.
The square root of 48676572 is about 6976.8597520661. The cubic root of 48676572 is about 365.1236761099.
The spelling of 48676572 in words is "forty-eight million, six hundred seventy-six thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •