Search a number
-
+
1001110111010 = 25100111011101
BaseRepresentation
bin11101001000101101101…
…00000000001100100010
310112201001002021220111122
432210112310000030202
5112400233142023020
62043523104012242
7132220304353202
oct16442664001442
93481032256448
101001110111010
11356628616809
12142031901082
1373534279769
143664da58402
151b093e48125
hexe916d00322

1001110111010 has 8 divisors (see below), whose sum is σ = 1801998199836. Its totient is φ = 400444044400.

The previous prime is 1001110110971. The next prime is 1001110111061. The reversal of 1001110111010 is 101110111001.

It can be written as a sum of positive squares in 2 ways, for example, as 992492145121 + 8617965889 = 996239^2 + 92833^2 .

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

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, 50055505541 + ... + 50055505560.

Almost surely, 21001110111010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 100111011108.

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

Adding to 1001110111010 its reverse (101110111001), we get a palindrome (1102220222011).

Subtracting from 1001110111010 its reverse (101110111001), we obtain a palindrome (900000000009).

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

Divisors: 1 2 5 10 100111011101 200222022202 500555055505 1001110111010