Base | Representation |
---|---|
bin | 110011001111101111… |
… | …1011101001000101110 |
3 | 101112001120111112002111 |
4 | 1212133133131020232 |
5 | 3300340300134200 |
6 | 122320053314234 |
7 | 10644066420142 |
oct | 1463737351056 |
9 | 345046445074 |
10 | 110050005550 |
11 | 427433a5011 |
12 | 193b363597a |
13 | a4ba9879a4 |
14 | 547dabd222 |
15 | 2ce16c40ba |
hex | 199f7dd22e |
110050005550 has 48 divisors (see below), whose sum is σ = 213698509920. Its totient is φ = 42085232640.
The previous prime is 110050005521. The next prime is 110050005577. The reversal of 110050005550 is 55500050011.
It is a super-3 number, since 3×1100500055503 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2407306 + ... + 2452594.
It is an arithmetic number, because the mean of its divisors is an integer number (4452052290).
Almost surely, 2110050005550 is an apocalyptic number.
110050005550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110050005550 is a deficient number, since it is larger than the sum of its proper divisors (103648504370).
110050005550 is a wasteful number, since it uses less digits than its factorization.
110050005550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47437 (or 47432 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 22.
Adding to 110050005550 its reverse (55500050011), we get a palindrome (165550055561).
The spelling of 110050005550 in words is "one hundred ten billion, fifty million, five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •