Search a number
-
+
110142440553 = 336714146851
BaseRepresentation
bin110011010010100000…
…0000100010001101001
3101112022000102201002010
41212211000010101221
53301032431044203
6122333154430133
710646301204015
oct1464500042151
9345260381063
10110142440553
1142790599882
121941a592349
13a503b80062
14548c0a1545
152ce9882303
hex19a5004469

110142440553 has 4 divisors (see below), whose sum is σ = 146856587408. Its totient is φ = 73428293700.

The previous prime is 110142440537. The next prime is 110142440561. The reversal of 110142440553 is 355044241011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 110142440553 - 24 = 110142440537 is a prime.

It is a super-2 number, since 2×1101424405532 (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 110142440553.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2110142440553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 36714146854.

The product of its (nonzero) digits is 9600, while the sum is 30.

Adding to 110142440553 its reverse (355044241011), we get a palindrome (465186681564).

The spelling of 110142440553 in words is "one hundred ten billion, one hundred forty-two million, four hundred forty thousand, five hundred fifty-three".

Divisors: 1 3 36714146851 110142440553