Base | Representation |
---|---|
bin | 1011110011100… |
… | …0001111001110 |
3 | 10110011112122110 |
4 | 2330320033032 |
5 | 100133412142 |
6 | 4525124450 |
7 | 1140600000 |
oct | 274701716 |
9 | 113145573 |
10 | 49513422 |
11 | 25a49192 |
12 | 146b9726 |
13 | a347aaa |
14 | 680c370 |
15 | 453099c |
hex | 2f383ce |
49513422 has 48 divisors (see below), whose sum is σ = 115765632. Its totient is φ = 14117880.
The previous prime is 49513381. The next prime is 49513423. The reversal of 49513422 is 22431594.
It is a self number, because there is not a number n which added to its sum of digits gives 49513422.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49513423) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100597 + ... + 101087.
It is an arithmetic number, because the mean of its divisors is an integer number (2411784).
Almost surely, 249513422 is an apocalyptic number.
49513422 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 49513422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57882816).
49513422 is an abundant number, since it is smaller than the sum of its proper divisors (66252210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49513422 is an frugal number, since it uses more digits than its factorization.
49513422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531 (or 503 counting only the distinct ones).
The product of its digits is 8640, while the sum is 30.
The square root of 49513422 is about 7036.5774350887. The cubic root of 49513422 is about 367.2042064299.
The spelling of 49513422 in words is "forty-nine million, five hundred thirteen thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •