Base | Representation |
---|---|
bin | 110011001110111000… |
… | …011000101011100000 |
3 | 12020222202221200220011 |
4 | 303032320120223200 |
5 | 1400130141321300 |
6 | 41134345454304 |
7 | 3655132331323 |
oct | 631670305340 |
9 | 166882850804 |
10 | 55010495200 |
11 | 21369a99281 |
12 | a7b2aa1394 |
13 | 5258b3469b |
14 | 293bd647ba |
15 | 166e6c0eba |
hex | ccee18ae0 |
55010495200 has 36 divisors (see below), whose sum is σ = 134294373360. Its totient is φ = 22004197760.
The previous prime is 55010495087. The next prime is 55010495209. The reversal of 55010495200 is 259401055.
It is a super-3 number, since 3×550104952003 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55010495209) 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 5 ways as a sum of consecutive naturals, for example, 34380760 + ... + 34382359.
It is an arithmetic number, because the mean of its divisors is an integer number (3730399260).
Almost surely, 255010495200 is an apocalyptic number.
55010495200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55010495200 is an abundant number, since it is smaller than the sum of its proper divisors (79283878160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55010495200 is a wasteful number, since it uses less digits than its factorization.
55010495200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68763139 (or 68763126 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 55010495200 its reverse (259401055), we get a palindrome (55269896255).
The spelling of 55010495200 in words is "fifty-five billion, ten million, four hundred ninety-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •