Base | Representation |
---|---|
bin | 1011110100111… |
… | …1110110010101 |
3 | 10110100110022100 |
4 | 2331033312111 |
5 | 100200011013 |
6 | 4531152313 |
7 | 1141451646 |
oct | 275176625 |
9 | 113313270 |
10 | 49610133 |
11 | 26004911 |
12 | 14745699 |
13 | a37cb11 |
14 | 68356cd |
15 | 454e473 |
hex | 2f4fd95 |
49610133 has 6 divisors (see below), whose sum is σ = 71659094. Its totient is φ = 33073416.
The previous prime is 49610117. The next prime is 49610147. The reversal of 49610133 is 33101694.
49610133 is a `hidden beast` number, since 49 + 610 + 1 + 3 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 31102929 + 18507204 = 5577^2 + 4302^2 .
It is not a de Polignac number, because 49610133 - 24 = 49610117 is a prime.
It is a super-2 number, since 2×496101332 = 4922330592555378, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 49610097 and 49610106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49610153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2756110 + ... + 2756127.
Almost surely, 249610133 is an apocalyptic number.
It is an amenable number.
49610133 is a deficient number, since it is larger than the sum of its proper divisors (22048961).
49610133 is a wasteful number, since it uses less digits than its factorization.
49610133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5512243 (or 5512240 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 49610133 is about 7043.4461025836. The cubic root of 49610133 is about 367.4431287811.
The spelling of 49610133 in words is "forty-nine million, six hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •