Base | Representation |
---|---|
bin | 11001001000101110001110… |
… | …010100110100101011001011 |
3 | 112111102112021222111011101210 |
4 | 121020232032110310223023 |
5 | 103442230012032230201 |
6 | 1031042115543344203 |
7 | 32200004466336402 |
oct | 3110561624645313 |
9 | 474375258434353 |
10 | 110550551055051 |
11 | 32252253029538 |
12 | 1049552ba52063 |
13 | 498bb453ab713 |
14 | 1d42964b3a639 |
15 | cbaa1828b1d6 |
hex | 648b8e534acb |
110550551055051 has 8 divisors (see below), whose sum is σ = 155158668147520. Its totient is φ = 69821400666312.
The previous prime is 110550551055011. The next prime is 110550551055059. The reversal of 110550551055051 is 150550155055011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110550551055051 - 26 = 110550551054987 is a prime.
It is a super-2 number, since 2×1105505510550512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110550551055059) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 969741675865 + ... + 969741675978.
It is an arithmetic number, because the mean of its divisors is an integer number (19394833518440).
Almost surely, 2110550551055051 is an apocalyptic number.
110550551055051 is a deficient number, since it is larger than the sum of its proper divisors (44608117092469).
110550551055051 is a wasteful number, since it uses less digits than its factorization.
110550551055051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1939483351865.
The product of its (nonzero) digits is 78125, while the sum is 39.
The spelling of 110550551055051 in words is "one hundred ten trillion, five hundred fifty billion, five hundred fifty-one million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •