Base | Representation |
---|---|
bin | 11001001111010001110101… |
… | …00110010000010000011100 |
3 | 21021111210121210100200101011 |
4 | 30213220322212100100130 |
5 | 24233310111412134000 |
6 | 314012333444225004 |
7 | 14455532244321142 |
oct | 1447507246202034 |
9 | 237453553320334 |
10 | 55500550505500 |
11 | 16758718955a71 |
12 | 628446609b164 |
13 | 24c78aa9c15b9 |
14 | d9c353355592 |
15 | 663a6b4a72ba |
hex | 327a3a99041c |
55500550505500 has 24 divisors (see below), whose sum is σ = 121213202305104. Its totient is φ = 22200220202000.
The previous prime is 55500550505489. The next prime is 55500550505503. The reversal of 55500550505500 is 550505500555.
It is a super-2 number, since 2×555005505055002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55500550505503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55500550006 + ... + 55500551005.
It is an arithmetic number, because the mean of its divisors is an integer number (5050550096046).
Almost surely, 255500550505500 is an apocalyptic number.
55500550505500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55500550505500 is an abundant number, since it is smaller than the sum of its proper divisors (65712651799604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55500550505500 is a wasteful number, since it uses less digits than its factorization.
55500550505500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111001101030 (or 111001101018 counting only the distinct ones).
The product of its (nonzero) digits is 390625, while the sum is 40.
The spelling of 55500550505500 in words is "fifty-five trillion, five hundred billion, five hundred fifty million, five hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.321 sec. • engine limits •