Base | Representation |
---|---|
bin | 101101101100001110… |
… | …000101000000000000 |
3 | 11200122002112221112000 |
4 | 231230032011000000 |
5 | 1300433412120310 |
6 | 34312111504000 |
7 | 3354521262243 |
oct | 555416050000 |
9 | 150562487460 |
10 | 49060270080 |
11 | 19896275058 |
12 | 9612228000 |
13 | 481b175713 |
14 | 25359d125a |
15 | 142211b4c0 |
hex | b6c385000 |
49060270080 has 624 divisors, whose sum is σ = 185881967040. Its totient is φ = 12273057792.
The previous prime is 49060270031. The next prime is 49060270081. The reversal of 49060270080 is 8007206094.
49060270080 is a `hidden beast` number, since 49 + 0 + 602 + 7 + 0 + 0 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49060270081) 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, 159805287 + ... + 159805593.
Almost surely, 249060270080 is an apocalyptic number.
49060270080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49060270080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92940983520).
49060270080 is an abundant number, since it is smaller than the sum of its proper divisors (136821696960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49060270080 is a wasteful number, since it uses less digits than its factorization.
49060270080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 379 (or 334 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The spelling of 49060270080 in words is "forty-nine billion, sixty million, two hundred seventy thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •