Search a number
-
+
110131100212 = 2273933253579
BaseRepresentation
bin110011010010001010…
…0110011101000110100
3101112021020002120001111
41212210110303220310
53301022030201322
6122332111404404
710646102622550
oct1464424635064
9345236076044
10110131100212
11427851536a1
1219416823704
13a50170c3b3
14548a78c860
152ce8892177
hex19a4533a34

110131100212 has 12 divisors (see below), whose sum is σ = 220262200480. Its totient is φ = 47199042936.

The previous prime is 110131100179. The next prime is 110131100213. The reversal of 110131100212 is 212001131011.

It is a happy number.

110131100212 is an admirable number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110131100213) 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 3 ways as a sum of consecutive naturals, for example, 1966626762 + ... + 1966626817.

Almost surely, 2110131100212 is an apocalyptic number.

It is an amenable number.

110131100212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

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

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

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

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

Adding to 110131100212 its reverse (212001131011), we get a palindrome (322132231223).

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

Divisors: 1 2 4 7 14 28 3933253579 7866507158 15733014316 27532775053 55065550106 110131100212