Search a number
-
+
1126770895872 = 21032375362347
BaseRepresentation
bin10000011001011000110…
…001110110110000000000
310222201101121020011222200
4100121120301312300000
5121430111322131442
62221344214433200
7144256301405436
oct20313061666000
93881347204880
101126770895872
113a4951883326
12162461362800
138233c18156b
143c770b0cd56
151e49ad7d34c
hex10658c76c00

1126770895872 has 264 divisors, whose sum is σ = 3404560672656. Its totient is φ = 358538379264.

The previous prime is 1126770895849. The next prime is 1126770895979. The reversal of 1126770895872 is 2785980776211.

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

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, 18041403 + ... + 18103749.

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

Almost surely, 21126770895872 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 23708160, while the sum is 63.

The spelling of 1126770895872 in words is "one trillion, one hundred twenty-six billion, seven hundred seventy million, eight hundred ninety-five thousand, eight hundred seventy-two".