Search a number
-
+
11010110001102 = 232611672777839
BaseRepresentation
bin1010000000110111110110…
…1100100000111111001110
31102222120000111101221120200
42200031331230200333032
52420342201130013402
635225550311554330
72214311534603232
oct240157554407716
942876014357520
1011010110001102
1135653a8076423
1212999bb68b9a6
1361b330b47224
142a0c6c1705c2
151415e904521c
hexa037db20fce

11010110001102 has 12 divisors (see below), whose sum is σ = 23855238335760. Its totient is φ = 3670036667028.

The previous prime is 11010110001091. The next prime is 11010110001131. The reversal of 11010110001102 is 20110001101011.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 305836388902 + ... + 305836388937.

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

Almost surely, 211010110001102 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 11010110001102 its reverse (20110001101011), we get a palindrome (31120111102113).

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

Divisors: 1 2 3 6 9 18 611672777839 1223345555678 1835018333517 3670036667034 5505055000551 11010110001102