Base | Representation |
---|---|
bin | 101101101110011010… |
… | …101101010010000000 |
3 | 11200201122220220000000 |
4 | 231232122231102000 |
5 | 1301022331311412 |
6 | 34315510000000 |
7 | 3355446522645 |
oct | 555632552200 |
9 | 150648826000 |
10 | 49097135232 |
11 | 19905064422 |
12 | 9622646000 |
13 | 48259b2412 |
14 | 253a869dcc |
15 | 142549e4dc |
hex | b6e6ad480 |
49097135232 has 256 divisors, whose sum is σ = 147955814400. Its totient is φ = 16225090560.
The previous prime is 49097135189. The next prime is 49097135233. The reversal of 49097135232 is 23253179094.
49097135232 is a `hidden beast` number, since 490 + 9 + 7 + 135 + 23 + 2 = 666.
It is not an unprimeable number, because it can be changed into a prime (49097135233) 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 31 ways as a sum of consecutive naturals, for example, 35551182 + ... + 35552562.
It is an arithmetic number, because the mean of its divisors is an integer number (577952400).
Almost surely, 249097135232 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 49097135232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73977907200).
49097135232 is an abundant number, since it is smaller than the sum of its proper divisors (98858679168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49097135232 is an equidigital number, since it uses as much as digits as its factorization.
49097135232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1543 (or 1513 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 45.
The spelling of 49097135232 in words is "forty-nine billion, ninety-seven million, one hundred thirty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •