Base | Representation |
---|---|
bin | 101110001111010011… |
… | …101100101111000000 |
3 | 11202011010020210020000 |
4 | 232033103230233000 |
5 | 1303140112233422 |
6 | 34450341120000 |
7 | 3405230036013 |
oct | 561723545700 |
9 | 152133223200 |
10 | 49648946112 |
11 | 1a068599077 |
12 | 97573b9000 |
13 | 48b3107c2c |
14 | 258dc6b37a |
15 | 1458b4dcac |
hex | b8f4ecbc0 |
49648946112 has 140 divisors (see below), whose sum is σ = 147350597856. Its totient is φ = 16529909760.
The previous prime is 49648946071. The next prime is 49648946129. The reversal of 49648946112 is 21164984694.
49648946112 is a `hidden beast` number, since 4 + 9 + 6 + 489 + 46 + 112 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4717368 + ... + 4727880.
Almost surely, 249648946112 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 49648946112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73675298928).
49648946112 is an abundant number, since it is smaller than the sum of its proper divisors (97701651744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49648946112 is a wasteful number, since it uses less digits than its factorization.
49648946112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11448 (or 11429 counting only the distinct ones).
The product of its digits is 2985984, while the sum is 54.
The spelling of 49648946112 in words is "forty-nine billion, six hundred forty-eight million, nine hundred forty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •