Search a number
-
+
105049151551 = 179395855909
BaseRepresentation
bin110000111010101101…
…0101101100000111111
3101001011001111211001201
41201311122231200333
53210120040322201
6120131531520331
710406134024651
oct1416532554077
9331131454051
10105049151551
1140607564423
12184388b90a7
139ba18ba496
1451278786d1
152aec64e801
hex18756ad83f

105049151551 has 4 divisors (see below), whose sum is σ = 105055025400. Its totient is φ = 105043277704.

The previous prime is 105049151531. The next prime is 105049151609. The reversal of 105049151551 is 155151940501.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155151940501 = 218833708997.

It is a cyclic number.

It is not a de Polignac number, because 105049151551 - 213 = 105049143359 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (105049151531) 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, 2910016 + ... + 2945893.

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

Almost surely, 2105049151551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5873848.

The product of its (nonzero) digits is 22500, while the sum is 37.

The spelling of 105049151551 in words is "one hundred five billion, forty-nine million, one hundred fifty-one thousand, five hundred fifty-one".

Divisors: 1 17939 5855909 105049151551