Search a number
-
+
110501419027 = 15125713672083
BaseRepresentation
bin110011011101001100…
…1011101100000010011
3101120020000220200222011
41212322121131200103
53302301330402102
6122432540523351
710661220364336
oct1467231354023
9346200820864
10110501419027
11429551966aa
12194ba850557
13a56035ab5c
1454c3a2861d
152d1b1412d7
hex19ba65d813

110501419027 has 16 divisors (see below), whose sum is σ = 111801364992. Its totient is φ = 109210060800.

The previous prime is 110501419009. The next prime is 110501419031. The reversal of 110501419027 is 720914105011.

It is a cyclic number.

It is not a de Polignac number, because 110501419027 - 231 = 108353935379 is a prime.

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 110501419027.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53048128 + ... + 53050210.

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

Almost surely, 2110501419027 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3858.

The product of its (nonzero) digits is 2520, while the sum is 31.

The spelling of 110501419027 in words is "one hundred ten billion, five hundred one million, four hundred nineteen thousand, twenty-seven".

Divisors: 1 151 257 1367 2083 38807 206417 314533 351319 535331 2847461 53049169 80834981 429966611 731797477 110501419027