Search a number
-
+
105055511051 = 421249538031
BaseRepresentation
bin110000111010111001…
…0111110001000001011
3101001011111110220122202
41201311302332020023
53210123202323201
6120132320110415
710406242052531
oct1416562761013
9331144426582
10105055511051
1140610108407
121843aa6540b
139ba3005cba
145128652151
152aecea8c6b
hex1875cbe20b

105055511051 has 4 divisors (see below), whose sum is σ = 105305049504. Its totient is φ = 104805972600.

The previous prime is 105055511047. The next prime is 105055511053. The reversal of 105055511051 is 150115550501.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 105055511051 - 22 = 105055511047 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2105055511051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 249538452.

The product of its (nonzero) digits is 3125, while the sum is 29.

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

Divisors: 1 421 249538031 105055511051