Search a number
-
+
105055556051 = 363728885223
BaseRepresentation
bin110000111010111001…
…1001001000111010011
3101001011111120012101102
41201311303021013103
53210123210243201
6120132321055015
710406242330655
oct1416563110723
9331144505342
10105055556051
11406101391a6
121843aa8746b
139ba3020624
1451286646d5
152aeceb726b
hex1875cc91d3

105055556051 has 4 divisors (see below), whose sum is σ = 105084444912. Its totient is φ = 105026667192.

The previous prime is 105055555981. The next prime is 105055556077. The reversal of 105055556051 is 150655550501.

It is a happy number.

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-105055556051 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 105055555996 and 105055556014.

It is not an unprimeable number, because it can be changed into a prime (105055559051) 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 3 ways as a sum of consecutive naturals, for example, 14438975 + ... + 14446248.

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

Almost surely, 2105055556051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 28888860.

The product of its (nonzero) digits is 93750, while the sum is 38.

The spelling of 105055556051 in words is "one hundred five billion, fifty-five million, five hundred fifty-six thousand, fifty-one".

Divisors: 1 3637 28885223 105055556051