Search a number
-
+
110050120002 = 2340145739867
BaseRepresentation
bin110011001111101111…
…1111001000101000010
3101112001120201100002110
41212133133321011002
53300340312320002
6122320100000150
710644100404624
oct1463737710502
9345046640073
10110050120002
1142743472aa9
12193b3690056
13a4ba9c7b04
14547db0cc14
152ce16e7e6c
hex199f7f9142

110050120002 has 16 divisors (see below), whose sum is σ = 220649123232. Its totient is φ = 36591892800.

The previous prime is 110050119937. The next prime is 110050120003. The reversal of 110050120002 is 200021050011.

It is a super-2 number, since 2×1100501200022 (a number of 23 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 110050120002.

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

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

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

Almost surely, 2110050120002 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 45740273.

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

Adding to 110050120002 its reverse (200021050011), we get a palindrome (310071170013).

The spelling of 110050120002 in words is "one hundred ten billion, fifty million, one hundred twenty thousand, two".

Divisors: 1 2 3 6 401 802 1203 2406 45739867 91479734 137219601 274439202 18341686667 36683373334 55025060001 110050120002