Search a number
-
+
110201102012 = 2291929978537
BaseRepresentation
bin110011010100001111…
…1110101111010111100
3101112110002211000110202
41212220133311322330
53301142440231022
6122343052023032
710650612624461
oct1465037657274
9345402730422
10110201102012
1142810716021
1219436161a78
13a51307b991
145495bb1668
152ceeabd592
hex19a87f5ebc

110201102012 has 12 divisors (see below), whose sum is σ = 193061784720. Its totient is φ = 55040592096.

The previous prime is 110201102009. The next prime is 110201102017. The reversal of 110201102012 is 210201102011.

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

It is a congruent number.

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

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 3 ways as a sum of consecutive naturals, for example, 14985593 + ... + 14992944.

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

Almost surely, 2110201102012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110201102012 its reverse (210201102011), we get a palindrome (320402204023).

Subtracting 110201102012 from its reverse (210201102011), we obtain a palindrome (99999999999).

The spelling of 110201102012 in words is "one hundred ten billion, two hundred one million, one hundred two thousand, twelve".

Divisors: 1 2 4 919 1838 3676 29978537 59957074 119914148 27550275503 55100551006 110201102012