Search a number
-
+
105011343451 = 715001620493
BaseRepresentation
bin110000111001100101…
…0011111000001011011
3101001001102100222002201
41201303022133001123
53210030400442301
6120124101311031
710405164456160
oct1416312370133
9331042328081
10105011343451
1140598190663
1218428105477
139b96b10521
145122836067
152ae9182201
hex187329f05b

105011343451 has 4 divisors (see below), whose sum is σ = 120012963952. Its totient is φ = 90009722952.

The previous prime is 105011343419. The next prime is 105011343529. The reversal of 105011343451 is 154343110501.

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 105011343451 - 25 = 105011343419 is a prime.

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

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

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

Almost surely, 2105011343451 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15001620500.

The product of its (nonzero) digits is 3600, while the sum is 28.

Adding to 105011343451 its reverse (154343110501), we get a palindrome (259354453952).

The spelling of 105011343451 in words is "one hundred five billion, eleven million, three hundred forty-three thousand, four hundred fifty-one".

Divisors: 1 7 15001620493 105011343451