Base | Representation |
---|---|
bin | 11001000010001111110010… |
… | …110110101010111110101111 |
3 | 112102211222200212021210021200 |
4 | 121002033302312222332233 |
5 | 103412432142112113210 |
6 | 1030101444011300543 |
7 | 32122602305612103 |
oct | 3102176266527657 |
9 | 472758625253250 |
10 | 110105561051055 |
11 | 320a0562849259 |
12 | 1042324174a753 |
13 | 4958ba9c4c04b |
14 | 1d291cd78b903 |
15 | cae171c7b0c0 |
hex | 6423f2daafaf |
110105561051055 has 24 divisors (see below), whose sum is σ = 192817161215952. Its totient is φ = 58117574490624.
The previous prime is 110105561051047. The next prime is 110105561051069. The reversal of 110105561051055 is 550150165501011.
110105561051055 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 0 + 556 + 1 + 0 + 51 + 0 + 55 = 666.
It is not a de Polignac number, because 110105561051055 - 23 = 110105561051047 is a prime.
It is a super-2 number, since 2×1101055610510552 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12612316489 + ... + 12612325218.
It is an arithmetic number, because the mean of its divisors is an integer number (8034048383998).
Almost surely, 2110105561051055 is an apocalyptic number.
110105561051055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
110105561051055 is a deficient number, since it is larger than the sum of its proper divisors (82711600164897).
110105561051055 is a wasteful number, since it uses less digits than its factorization.
110105561051055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25224641815 (or 25224641812 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 36.
The spelling of 110105561051055 in words is "one hundred ten trillion, one hundred five billion, five hundred sixty-one million, fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •