Search a number
-
+
1106050010 = 251373116549
BaseRepresentation
bin100000111101100…
…1111101111011010
32212002020011101012
41001323033233122
54231122100020
6301430253522
736260161412
oct10173175732
92762204335
101106050010
1151837781a
1226a4b72a2
131481bb680
14a6c75642
156717d7c5
hex41ecfbda

1106050010 has 32 divisors (see below), whose sum is σ = 2173424400. Its totient is φ = 402789888.

The previous prime is 1106049941. The next prime is 1106050019. The reversal of 1106050010 is 100506011.

It can be written as a sum of positive squares in 8 ways, for example, as 266962921 + 839087089 = 16339^2 + 28967^2 .

It is a Curzon number.

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

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 15 ways as a sum of consecutive naturals, for example, 48785 + ... + 67764.

Almost surely, 21106050010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 116642.

The product of its (nonzero) digits is 30, while the sum is 14.

The square root of 1106050010 is about 33257.3301694529. The cubic root of 1106050010 is about 1034.1691730728.

Adding to 1106050010 its reverse (100506011), we get a palindrome (1206556021).

The spelling of 1106050010 in words is "one billion, one hundred six million, fifty thousand, ten".

Divisors: 1 2 5 10 13 26 65 73 130 146 365 730 949 1898 4745 9490 116549 233098 582745 1165490 1515137 3030274 7575685 8508077 15151370 17016154 42540385 85080770 110605001 221210002 553025005 1106050010