Base | Representation |
---|---|
bin | 1011110101000… |
… | …1000100011100 |
3 | 10110100201011111 |
4 | 2331101010130 |
5 | 100200141012 |
6 | 4531231404 |
7 | 1141502350 |
oct | 275210434 |
9 | 113321144 |
10 | 49615132 |
11 | 26008646 |
12 | 14748564 |
13 | a382188 |
14 | 6837460 |
15 | 4550ba7 |
hex | 2f5111c |
49615132 has 24 divisors (see below), whose sum is σ = 99604064. Its totient is φ = 21183552.
The previous prime is 49615123. The next prime is 49615133. The reversal of 49615132 is 23151694.
It is a super-2 number, since 2×496151322 = 4923322646754848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 49615094 and 49615103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49615133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4558 + ... + 10954.
Almost surely, 249615132 is an apocalyptic number.
It is an amenable number.
49615132 is an abundant number, since it is smaller than the sum of its proper divisors (49988932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49615132 is a wasteful number, since it uses less digits than its factorization.
49615132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6685 (or 6683 counting only the distinct ones).
The product of its digits is 6480, while the sum is 31.
The square root of 49615132 is about 7043.8009625486. The cubic root of 49615132 is about 367.4554702552.
The spelling of 49615132 in words is "forty-nine million, six hundred fifteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •