Search a number
-
+
110056060051110 = 232513137012522209
BaseRepresentation
bin11001000001100001101100…
…010111010101111010100110
3112102200020221001102110001100
4121001201230113111322212
5103411124302333113420
61030023020033140530
732116200523220025
oct3101415427257246
9472606831373040
10110056060051110
113208157081a348
12104157279ba746
13495431b6a4234
141d26a554328bc
15cacc26103190
hex64186c5d5ea6

110056060051110 has 96 divisors (see below), whose sum is σ = 288408095220960. Its totient is φ = 29116369152000.

The previous prime is 110056060051087. The next prime is 110056060051111. The reversal of 110056060051110 is 11150060650011.

110056060051110 is a `hidden beast` number, since 1 + 1 + 0 + 0 + 5 + 6 + 0 + 600 + 51 + 1 + 1 + 0 = 666.

It is a super-2 number, since 2×1100560600511102 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110056060051111) 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 47 ways as a sum of consecutive naturals, for example, 42373686 + ... + 44895894.

It is an arithmetic number, because the mean of its divisors is an integer number (3004250991885).

Almost surely, 2110056060051110 is an apocalyptic number.

110056060051110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 110056060051110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144204047610480).

110056060051110 is an abundant number, since it is smaller than the sum of its proper divisors (178352035169850).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

110056060051110 is a wasteful number, since it uses less digits than its factorization.

110056060051110 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2526054 (or 2526051 counting only the distinct ones).

The product of its (nonzero) digits is 900, while the sum is 27.

The spelling of 110056060051110 in words is "one hundred ten trillion, fifty-six billion, sixty million, fifty-one thousand, one hundred ten".

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 131 262 393 655 786 1179 1310 1965 2358 3701 3930 5895 7402 11103 11790 18505 22206 33309 37010 55515 66618 111030 166545 333090 484831 969662 1454493 2424155 2522209 2908986 4363479 4848310 5044418 7272465 7566627 8726958 12611045 14544930 15133254 21817395 22699881 25222090 37833135 43634790 45399762 75666270 113499405 226998810 330409379 660818758 991228137 1652046895 1982456274 2973684411 3304093790 4956140685 5947368822 9334695509 9912281370 14868422055 18669391018 28004086527 29736844110 46673477545 56008173054 84012259581 93346955090 140020432635 168024519162 280040865270 420061297905 840122595810 1222845111679 2445690223358 3668535335037 6114225558395 7337070670074 11005606005111 12228451116790 18342676675185 22011212010222 36685353350370 55028030025555 110056060051110