Base | Representation |
---|---|
bin | 101101110010010100… |
… | …111100100110000000 |
3 | 11200220020100122112020 |
4 | 231302110330212000 |
5 | 1301141124441302 |
6 | 34330212001440 |
7 | 3360204225603 |
oct | 556224744600 |
9 | 150806318466 |
10 | 49162733952 |
11 | 19939099742 |
12 | 9640600280 |
13 | 483646c827 |
14 | 254546433a |
15 | 142b10aebc |
hex | b7253c980 |
49162733952 has 384 divisors, whose sum is σ = 143284377600. Its totient is φ = 14916894720.
The previous prime is 49162733951. The next prime is 49162734011. The reversal of 49162733952 is 25933726194.
It is a tau number, because it is divible by the number of its divisors (384).
It is a junction number, because it is equal to n+sod(n) for n = 49162733895 and 49162733904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49162733951) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 622313049 + ... + 622313127.
It is an arithmetic number, because the mean of its divisors is an integer number (373136400).
Almost surely, 249162733952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49162733952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71642188800).
49162733952 is an abundant number, since it is smaller than the sum of its proper divisors (94121643648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49162733952 is a wasteful number, since it uses less digits than its factorization.
49162733952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242 (or 201 counting only the distinct ones).
The product of its digits is 2449440, while the sum is 51.
The spelling of 49162733952 in words is "forty-nine billion, one hundred sixty-two million, seven hundred thirty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •