Base | Representation |
---|---|
bin | 1011100111110… |
… | …0010000011100 |
3 | 10101201102110001 |
4 | 2321330100130 |
5 | 44434242302 |
6 | 4500424044 |
7 | 1131212122 |
oct | 271742034 |
9 | 111642401 |
10 | 48743452 |
11 | 2557274a |
12 | 143a8024 |
13 | a1384a4 |
14 | 668b912 |
15 | 442c787 |
hex | 2e7c41c |
48743452 has 6 divisors (see below), whose sum is σ = 85301048. Its totient is φ = 24371724.
The previous prime is 48743449. The next prime is 48743473. The reversal of 48743452 is 25434784.
48743452 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×487434522 = 4751848225752608, which contains 22 as substring.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 6092928 + ... + 6092935.
Almost surely, 248743452 is an apocalyptic number.
It is an amenable number.
48743452 is a deficient number, since it is larger than the sum of its proper divisors (36557596).
48743452 is a wasteful number, since it uses less digits than its factorization.
48743452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12185867 (or 12185865 counting only the distinct ones).
The product of its digits is 107520, while the sum is 37.
The square root of 48743452 is about 6981.6510941181. The cubic root of 48743452 is about 365.2908222005.
The spelling of 48743452 in words is "forty-eight million, seven hundred forty-three thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •