Base | Representation |
---|---|
bin | 1011110101000… |
… | …0001001100000 |
3 | 10110100111222210 |
4 | 2331100021200 |
5 | 100200030420 |
6 | 4531202120 |
7 | 1141455351 |
oct | 275201140 |
9 | 113314883 |
10 | 49611360 |
11 | 26005827 |
12 | 14746340 |
13 | a380546 |
14 | 6835d28 |
15 | 454e9e0 |
hex | 2f50260 |
49611360 has 48 divisors (see below), whose sum is σ = 156277296. Its totient is φ = 13229568.
The previous prime is 49611349. The next prime is 49611371. The reversal of 49611360 is 6311694.
It is an interprime number because it is at equal distance from previous prime (49611349) and next prime (49611371).
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×496113602 = 4922574082099200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51199 + ... + 52158.
It is an arithmetic number, because the mean of its divisors is an integer number (3255777).
Almost surely, 249611360 is an apocalyptic number.
49611360 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
49611360 is an abundant number, since it is smaller than the sum of its proper divisors (106665936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49611360 is a wasteful number, since it uses less digits than its factorization.
49611360 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103375 (or 103367 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 30.
The square root of 49611360 is about 7043.5332042946. The cubic root of 49611360 is about 367.4461580614.
The spelling of 49611360 in words is "forty-nine million, six hundred eleven thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •