Search a number
-
+
110052155051 = 251438454801
BaseRepresentation
bin110011001111110011…
…1101001111010101011
3101112001201112201122122
41212133213221322223
53300341322430201
6122320211341455
710644123611666
oct1463747517253
9345051481578
10110052155051
1142744632a63
12193b42b188b
13a4bb25b197
1454800bc6dd
152ce199ae1b
hex199f9e9eab

110052155051 has 4 divisors (see below), whose sum is σ = 110490610104. Its totient is φ = 109613700000.

The previous prime is 110052155039. The next prime is 110052155113. The reversal of 110052155051 is 150551250011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110052155051 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 219227150 + ... + 219227651.

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

Almost surely, 2110052155051 is an apocalyptic number.

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

110052155051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 438455052.

The product of its (nonzero) digits is 1250, while the sum is 26.

The spelling of 110052155051 in words is "one hundred ten billion, fifty-two million, one hundred fifty-five thousand, fifty-one".

Divisors: 1 251 438454801 110052155051