Search a number
-
+
1011010000000 = 275771113101
BaseRepresentation
bin11101011011001001110…
…01000101010010000000
310120122121000200101010211
432231210321011102000
5113031022030000000
62052241313003504
7133020525131260
oct16554471052200
93518530611124
101011010000000
1135a848873950
12143b35253594
13744512b4a40
1436d0c79b7a0
151b47312d7ba
hexeb64e45480

1011010000000 has 1024 divisors, whose sum is σ = 3413803760640. Its totient is φ = 288000000000.

The previous prime is 1011009999991. The next prime is 1011010000001. The reversal of 1011010000000 is 101101.

Adding to 1011010000000 its reverse (101101), we get a palindrome (1011010101101).

1011010000000 divided by its reverse (101101) gives a 7-th power (10000000 = 107).

It can be divided in two parts, 101 and 1010000000, that added together give a palindrome (1010000101).

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10009999950 + ... + 10010000050.

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

Almost surely, 21011010000000 is an apocalyptic number.

1011010000000 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 1011010000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1706901880320).

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

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

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

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

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

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

The spelling of 1011010000000 in words is "one trillion, eleven billion, ten million", and thus it is an aban number and an uban number.