Search a number
-
+
13500110 = 2513113919
BaseRepresentation
bin110011011111…
…111011001110
3221101212200002
4303133323032
511424000420
61201204302
7222514631
oct63377316
927355602
1013500110
117690918
124630692
132a48a40
141b15c18
1512ba075
hexcdfece

13500110 has 32 divisors (see below), whose sum is σ = 26429760. Its totient is φ = 4935168.

The previous prime is 13500077. The next prime is 13500119. The reversal of 13500110 is 1100531.

It is a Curzon number.

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

It is a congruent number.

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

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 15 ways as a sum of consecutive naturals, for example, 14231 + ... + 15149.

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

Almost surely, 213500110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1052.

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

The square root of 13500110 is about 3674.2495832483. The cubic root of 13500110 is about 238.1108045124.

Adding to 13500110 its reverse (1100531), we get a palindrome (14600641).

The spelling of 13500110 in words is "thirteen million, five hundred thousand, one hundred ten".

Divisors: 1 2 5 10 13 26 65 113 130 226 565 919 1130 1469 1838 2938 4595 7345 9190 11947 14690 23894 59735 103847 119470 207694 519235 1038470 1350011 2700022 6750055 13500110