Search a number
-
+
11301111110 = 251636933197
BaseRepresentation
bin10101000011001100…
…10100010101000110
31002011121000221000202
422201212110111012
5141121041023420
65105222010502
7550023600542
oct124146242506
932147027022
1011301111110
11487a201053
122234876a32
1310b14240c3
14792c92a22
1546221c575
hex2a1994546

11301111110 has 16 divisors (see below), whose sum is σ = 20466800496. Its totient is φ = 4492711008.

The previous prime is 11301111079. The next prime is 11301111113. The reversal of 11301111110 is 1111110311.

It is a super-2 number, since 2×113011111102 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 11301111091 and 11301111100.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3464969 + ... + 3468228.

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

Almost surely, 211301111110 is an apocalyptic number.

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

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

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

11301111110 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 6933367.

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

Adding to 11301111110 its reverse (1111110311), we get a palindrome (12412221421).

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

Divisors: 1 2 5 10 163 326 815 1630 6933197 13866394 34665985 69331970 1130111111 2260222222 5650555555 11301111110