Base | Representation |
---|---|
bin | 110011001110010000… |
… | …010110011100101100 |
3 | 12020222001012111121011 |
4 | 303032100112130230 |
5 | 1400120000002200 |
6 | 41133332515004 |
7 | 3654644201050 |
oct | 631620263454 |
9 | 166861174534 |
10 | 55000000300 |
11 | 21364080303 |
12 | a7ab47ba64 |
13 | 52568cb79b |
14 | 293a7d1c60 |
15 | 166d7eb5ba |
hex | cce41672c |
55000000300 has 72 divisors (see below), whose sum is σ = 136628755200. Its totient is φ = 18825518400.
The previous prime is 55000000291. The next prime is 55000000313. The reversal of 55000000300 is 300000055.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 353715 + ... + 484885.
It is an arithmetic number, because the mean of its divisors is an integer number (1897621600).
Almost surely, 255000000300 is an apocalyptic number.
55000000300 is a gapful number since it is divisible by the number (50) 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 55000000300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68314377600).
55000000300 is an abundant number, since it is smaller than the sum of its proper divisors (81628754900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55000000300 is a wasteful number, since it uses less digits than its factorization.
55000000300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131791 (or 131784 counting only the distinct ones).
The product of its (nonzero) digits is 75, while the sum is 13.
Adding to 55000000300 its reverse (300000055), we get a palindrome (55300000355).
The spelling of 55000000300 in words is "fifty-five billion, three hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •