Search a number
-
+
11095561000000 = 265633312
BaseRepresentation
bin1010000101110110001011…
…1110001101010001000000
31110021201120201112110022201
42201131202332031101000
52423242202104000000
635333121431242544
72223425226242011
oct241354276152100
943251521473281
1011095561000000
113598667a18674
1212b2488b19454
136263cb397179
142a5056c49008
1514394ad5496a
hexa1762f8d440

11095561000000 has 147 divisors (see below), whose sum is σ = 27530104856241. Its totient is φ = 4436892000000.

The previous prime is 11095560999983. The next prime is 11095561000057. The reversal of 11095561000000 is 16559011.

The square root of 11095561000000 is 3331000.

It is a perfect power (a square), and thus also a powerful number.

It can be written as a sum of positive squares in 3 ways, for example, as 9720776609856 + 1374784390144 = 3117816^2 + 1172512^2 .

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

It is a Duffinian number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 3330998335 + ... + 3331001665.

Almost surely, 211095561000000 is an apocalyptic number.

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

11095561000000 is the 3331000-th square number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11095561000000

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

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

11095561000000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 1350, while the sum is 28.

Adding to 11095561000000 its reverse (16559011), we get a palindrome (11095577559011).

The spelling of 11095561000000 in words is "eleven trillion, ninety-five billion, five hundred sixty-one million", and thus it is an aban number.

Divisors: 1 2 4 5 8 10 16 20 25 32 40 50 64 80 100 125 160 200 250 320 400 500 625 800 1000 1250 1600 2000 2500 3125 3331 4000 5000 6250 6662 8000 10000 12500 13324 15625 16655 20000 25000 26648 31250 33310 40000 50000 53296 62500 66620 83275 100000 106592 125000 133240 166550 200000 213184 250000 266480 333100 416375 500000 532960 666200 832750 1000000 1065920 1332400 1665500 2081875 2664800 3331000 4163750 5329600 6662000 8327500 10409375 11095561 13324000 16655000 20818750 22191122 26648000 33310000 41637500 44382244 52046875 55477805 66620000 83275000 88764488 104093750 110955610 133240000 166550000 177528976 208187500 221911220 277389025 333100000 355057952 416375000 443822440 554778050 666200000 710115904 832750000 887644880 1109556100 1386945125 1665500000 1775289760 2219112200 2773890250 3331000000 3550579520 4438224400 5547780500 6934725625 8876448800 11095561000 13869451250 17752897600 22191122000 27738902500 34673628125 44382244000 55477805000 69347256250 88764488000 110955610000 138694512500 173368140625 221911220000 277389025000 346736281250 443822440000 554778050000 693472562500 1109556100000 1386945125000 2219112200000 2773890250000 5547780500000 11095561000000