Base | Representation |
---|---|
bin | 101101110110100010… |
… | …111000010000010100 |
3 | 11201002011111200112000 |
4 | 231312202320100110 |
5 | 1301312233320220 |
6 | 34341220355300 |
7 | 3362023542321 |
oct | 556642702024 |
9 | 151064450460 |
10 | 49233495060 |
11 | 1997502a5a2 |
12 | 9660245b30 |
13 | 48480168c9 |
14 | 2550a03b48 |
15 | 1432437390 |
hex | b768b8414 |
49233495060 has 192 divisors, whose sum is σ = 158995200000. Its totient is φ = 12634444800.
The previous prime is 49233495053. The next prime is 49233495061. The reversal of 49233495060 is 6059433294.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 49233494997 and 49233495015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49233495061) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3021816 + ... + 3038064.
It is an arithmetic number, because the mean of its divisors is an integer number (828100000).
Almost surely, 249233495060 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 49233495060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79497600000).
49233495060 is an abundant number, since it is smaller than the sum of its proper divisors (109761704940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49233495060 is a wasteful number, since it uses less digits than its factorization.
49233495060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16479 (or 16471 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 45.
The spelling of 49233495060 in words is "forty-nine billion, two hundred thirty-three million, four hundred ninety-five thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •