Search a number
-
+
110010901 = 71121397103
BaseRepresentation
bin1101000111010…
…10001000010101
321200000010120211
412203222020111
5211130322101
614525525421
72504035330
oct643521025
9250003524
10110010901
1157109900
1230a13871
1319a3a310
1410879617
1599d0c51
hex68ea215

110010901 has 48 divisors (see below), whose sum is σ = 151820032. Its totient is φ = 77552640.

The previous prime is 110010871. The next prime is 110010911. The reversal of 110010901 is 109010011.

It is not a de Polignac number, because 110010901 - 213 = 110002709 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1068016 + ... + 1068118.

Almost surely, 2110010901 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The square root of 110010901 is about 10488.6081536112. The cubic root of 110010901 is about 479.1578128404.

Adding to 110010901 its reverse (109010011), we get a palindrome (219020912).

The spelling of 110010901 in words is "one hundred ten million, ten thousand, nine hundred one".

Divisors: 1 7 11 13 77 91 97 103 121 143 679 721 847 1001 1067 1133 1261 1339 1573 7469 7931 8827 9373 9991 11011 11737 12463 13871 14729 69937 82159 87241 97097 103103 109901 129883 152581 162019 769307 909181 1068067 1134133 1208911 1428713 8462377 10000991 15715843 110010901