Base | Representation |
---|---|
bin | 1011101100011… |
… | …1101111011000 |
3 | 10102022010120011 |
4 | 2323013233120 |
5 | 100024141012 |
6 | 4511211304 |
7 | 1133640406 |
oct | 273075730 |
9 | 112263504 |
10 | 49052632 |
11 | 25763a72 |
12 | 14516b34 |
13 | a216135 |
14 | 672c476 |
15 | 448e1a7 |
hex | 2ec7bd8 |
49052632 has 16 divisors (see below), whose sum is σ = 92059200. Its totient is φ = 24503520.
The previous prime is 49052621. The next prime is 49052651. The reversal of 49052632 is 23625094.
It is a super-2 number, since 2×490526322 = 4812321412254848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 49052594 and 49052603.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9382 + ... + 13642.
It is an arithmetic number, because the mean of its divisors is an integer number (5753700).
Almost surely, 249052632 is an apocalyptic number.
It is an amenable number.
49052632 is a deficient number, since it is larger than the sum of its proper divisors (43006568).
49052632 is a wasteful number, since it uses less digits than its factorization.
49052632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5706 (or 5702 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 49052632 is about 7003.7584195916. The cubic root of 49052632 is about 366.0615422008.
The spelling of 49052632 in words is "forty-nine million, fifty-two thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •