Base | Representation |
---|---|
bin | 101111000101000101… |
… | …100110011100100000 |
3 | 11211111000001001022102 |
4 | 233011011212130200 |
5 | 1312012103020000 |
6 | 35120052025532 |
7 | 3436464165101 |
oct | 570505463440 |
9 | 154430031272 |
10 | 50551220000 |
11 | 1a490933876 |
12 | 99696022a8 |
13 | 49c80195c8 |
14 | 2637a1a3a8 |
15 | 14ace793d5 |
hex | bc5166720 |
50551220000 has 60 divisors (see below), whose sum is σ = 124363633086. Its totient is φ = 20220480000.
The previous prime is 50551219997. The next prime is 50551220003. The reversal of 50551220000 is 2215505.
It is an interprime number because it is at equal distance from previous prime (50551219997) and next prime (50551220003).
It can be written as a sum of positive squares in 5 ways, for example, as 10784656 + 50540435344 = 3284^2 + 224812^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (50551220003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1243781 + ... + 1283780.
Almost surely, 250551220000 is an apocalyptic number.
50551220000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50551220000 is an abundant number, since it is smaller than the sum of its proper divisors (73812413086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50551220000 is an equidigital number, since it uses as much as digits as its factorization.
50551220000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2527591 (or 2527568 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 20.
Adding to 50551220000 its reverse (2215505), we get a palindrome (50553435505).
The spelling of 50551220000 in words is "fifty billion, five hundred fifty-one million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •