Search a number
-
+
1100000001010 = 25110000000101
BaseRepresentation
bin10000000000011101000…
…110111111101111110010
310220011021220001211010011
4100000131012333233302
5121010300000013020
62201155533325134
7142321011510331
oct20003506775762
93804256054104
101100000001010
11394564361829
1215922b9367aa
137c963aa8881
143b3514a7d18
151d9309a135a
hex1001d1bfbf2

1100000001010 has 8 divisors (see below), whose sum is σ = 1980000001836. Its totient is φ = 440000000400.

The previous prime is 1100000000927. The next prime is 1100000001013. The reversal of 1100000001010 is 101000000011.

Adding to 1100000001010 its reverse (101000000011), we get a palindrome (1201000001021).

Subtracting from 1100000001010 its reverse (101000000011), we obtain a palindrome (999000000999).

It can be written as a sum of positive squares in 2 ways, for example, as 1072775991001 + 27224010009 = 1035749^2 + 164997^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55000000041 + ... + 55000000060.

Almost surely, 21100000001010 is an apocalyptic number.

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

1100000001010 is a deficient number, since it is larger than the sum of its proper divisors (880000000826).

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

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

The sum of its prime factors is 110000000108.

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

The spelling of 1100000001010 in words is "one trillion, one hundred billion, one thousand, ten".

Divisors: 1 2 5 10 110000000101 220000000202 550000000505 1100000001010