Search a number
-
+
105562141513 = 139759439867
BaseRepresentation
bin110001001001111111…
…1100111001101001001
3101002110210210101222221
41202103333213031021
53212142402012023
6120254455014041
710424633253343
oct1422377471511
9332423711887
10105562141513
1140850093374
121856066a321
139c53c7003a
145175a52293
152b2c6d185d
hex1893fe7349

105562141513 has 4 divisors (see below), whose sum is σ = 106321581520. Its totient is φ = 104802701508.

The previous prime is 105562141511. The next prime is 105562141523. The reversal of 105562141513 is 315141265501.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 315141265501 = 734317003637.

It is a cyclic number.

It is not a de Polignac number, because 105562141513 - 21 = 105562141511 is a prime.

It is a super-2 number, since 2×1055621415132 (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 (105562141511) 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, 379719795 + ... + 379720072.

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

Almost surely, 2105562141513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 759440006.

The product of its (nonzero) digits is 18000, while the sum is 34.

The spelling of 105562141513 in words is "one hundred five billion, five hundred sixty-two million, one hundred forty-one thousand, five hundred thirteen".

Divisors: 1 139 759439867 105562141513