Search a number
-
+
1011120020000 = 255423295569
BaseRepresentation
bin11101011011010110111…
…00110001101000100000
310120122212200200222012122
432231223130301220200
5113031233211120000
62052300243043412
7133023332235266
oct16555334615040
93518780628178
101011120020000
1135a8a4989572
12143b66070568
137446b02622c
1436d1d23a436
151b47cb12085
hexeb6b731a20

1011120020000 has 180 divisors, whose sum is σ = 2600388882630. Its totient is φ = 386859264000.

The previous prime is 1011120019981. The next prime is 1011120020003. The reversal of 1011120020000 is 200211101.

1011120020000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 5 ways, for example, as 63869420176 + 947250599824 = 252724^2 + 973268^2 .

It is a Harshad number since it is a multiple of its sum of digits (8).

It is a self number, because there is not a number n which added to its sum of digits gives 1011120020000.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1011120020003) by changing a digit.

It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 10532216 + ... + 10627784.

Almost surely, 21011120020000 is an apocalyptic number.

1011120020000 is a gapful number since it is divisible by the number (10) 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 1011120020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1300194441315).

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

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

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

1011120020000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 4, while the sum is 8.

Adding to 1011120020000 its reverse (200211101), we get a palindrome (1011320231101).

The spelling of 1011120020000 in words is "one trillion, eleven billion, one hundred twenty million, twenty thousand".