Search a number
-
+
105011429999 = 715001632857
BaseRepresentation
bin110000111001100101…
…0110100001001101111
3101001001102112100211012
41201303022310021233
53210030411224444
6120124103215435
710405165266410
oct1416312641157
9331042470735
10105011429999
114059823a693
121842814757b
139b96b40a38
145122859807
152ae919cb9e
hex18732b426f

105011429999 has 4 divisors (see below), whose sum is σ = 120013062864. Its totient is φ = 90009797136.

The previous prime is 105011429951. The next prime is 105011430001. The reversal of 105011429999 is 999924110501.

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

It is a de Polignac number, because none of the positive numbers 2k-105011429999 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2105011429999 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15001632864.

The product of its (nonzero) digits is 262440, while the sum is 50.

The spelling of 105011429999 in words is "one hundred five billion, eleven million, four hundred twenty-nine thousand, nine hundred ninety-nine".

Divisors: 1 7 15001632857 105011429999