Search a number
-
+
13111103010 = 235437036767
BaseRepresentation
bin11000011010111101…
…11000111000100010
31020211201212001010210
430031132320320202
5203322420244020
610005000234550
7642622352055
oct141536707042
936751761123
1013111103010
11561896a825
12265aa6ba56
13130c402125
148c540aa9c
1551b09b3e0
hex30d7b8e22

13111103010 has 16 divisors (see below), whose sum is σ = 31466647296. Its totient is φ = 3496294128.

The previous prime is 13111103003. The next prime is 13111103053. The reversal of 13111103010 is 1030111131.

13111103010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an unprimeable number.

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

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

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

Almost surely, 213111103010 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 437036777.

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

Adding to 13111103010 its reverse (1030111131), we get a palindrome (14141214141).

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

Divisors: 1 2 3 5 6 10 15 30 437036767 874073534 1311110301 2185183835 2622220602 4370367670 6555551505 13111103010