Base | Representation |
---|---|
bin | 101110110110110000… |
… | …101001000000000000 |
3 | 11210212020201201000000 |
4 | 232312300221000000 |
5 | 1311014034010131 |
6 | 35040144000000 |
7 | 3430515056460 |
oct | 566660510000 |
9 | 153766651000 |
10 | 50310844416 |
11 | 1a378184068 |
12 | 9901000000 |
13 | 498a296831 |
14 | 2613b27ba0 |
15 | 1496ce6ce6 |
hex | bb6c29000 |
50310844416 has 728 divisors, whose sum is σ = 180487702080. Its totient is φ = 13711638528.
The previous prime is 50310844379. The next prime is 50310844427. The reversal of 50310844416 is 61444801305.
50310844416 is a `hidden beast` number, since 503 + 108 + 4 + 4 + 41 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 606154711 + ... + 606154793.
Almost surely, 250310844416 is an apocalyptic number.
50310844416 is a gapful number since it is divisible by the number (56) 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 50310844416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90243851040).
50310844416 is an abundant number, since it is smaller than the sum of its proper divisors (130176857664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50310844416 is an frugal number, since it uses more digits than its factorization.
50310844416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161 (or 124 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The spelling of 50310844416 in words is "fifty billion, three hundred ten million, eight hundred forty-four thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •