Base | Representation |
---|---|
bin | 1011100000100… |
… | …1001111101100 |
3 | 10100211111020100 |
4 | 2320021033230 |
5 | 44324203424 |
6 | 4442351100 |
7 | 1124210520 |
oct | 270111754 |
9 | 110744210 |
10 | 48272364 |
11 | 25280818 |
12 | 141bb490 |
13 | a001c3a |
14 | 65a7d80 |
15 | 4387dc9 |
hex | 2e093ec |
48272364 has 72 divisors (see below), whose sum is σ = 140241920. Its totient is φ = 13714272.
The previous prime is 48272353. The next prime is 48272387. The reversal of 48272364 is 46327284.
48272364 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×482723642 = 4660442252296992, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 55767 + ... + 56625.
Almost surely, 248272364 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48272364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70120960).
48272364 is an abundant number, since it is smaller than the sum of its proper divisors (91969556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48272364 is a wasteful number, since it uses less digits than its factorization.
48272364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1099 (or 1094 counting only the distinct ones).
The product of its digits is 64512, while the sum is 36.
The square root of 48272364 is about 6947.8316041769. The cubic root of 48272364 is about 364.1102089502.
The spelling of 48272364 in words is "forty-eight million, two hundred seventy-two thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •