Search a number
-
+
1101311010010 = 25110131101001
BaseRepresentation
bin10000000001101011010…
…000000110010011011010
310220021200020221222101001
4100001223100012103122
5121020441104310020
62201534005015214
7142365341062111
oct20015320062332
93807606858331
101101311010010
11395077399242
121595369b450a
137cb12599743
143b437652c78
151d9aab1850a
hex1006b4064da

1101311010010 has 8 divisors (see below), whose sum is σ = 1982359818036. Its totient is φ = 440524404000.

The previous prime is 1101311009971. The next prime is 1101311010061. The reversal of 1101311010010 is 100101131011.

It can be written as a sum of positive squares in 2 ways, for example, as 881107000929 + 220204009081 = 938673^2 + 469259^2 .

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

It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 110131101001 = 1101311010010 / (1 + 1 + 0 + 1 + 3 + 1 + 1 + 0 + 1 + 0 + 0 + 1 + 0).

It is an unprimeable number.

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

Almost surely, 21101311010010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 110131101008.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 1101311010010 its reverse (100101131011), we get a palindrome (1201412141021).

The spelling of 1101311010010 in words is "one trillion, one hundred one billion, three hundred eleven million, ten thousand, ten".

Divisors: 1 2 5 10 110131101001 220262202002 550655505005 1101311010010