Search a number
-
+
105150001513 = 687911528543
BaseRepresentation
bin110000111101101101…
…1011011000101101001
3101001102002021112012111
41201323123123011221
53210321400022023
6120145533242321
710411500160114
oct1417333330551
9331362245174
10105150001513
11406594864a7
12184666333a1
139bb976ab0b
14513700b57b
152b0642100d
hex187b6db169

105150001513 has 4 divisors (see below), whose sum is σ = 105151598848. Its totient is φ = 105148404180.

The previous prime is 105150001511. The next prime is 105150001549. The reversal of 105150001513 is 315100051501.

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: 315100051501 = 595340678839.

It is a cyclic number.

It is not a de Polignac number, because 105150001513 - 21 = 105150001511 is a prime.

It is a super-2 number, since 2×1051500015132 (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 (105150001511) 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, 695481 + ... + 833062.

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

Almost surely, 2105150001513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1597334.

The product of its (nonzero) digits is 375, while the sum is 22.

The spelling of 105150001513 in words is "one hundred five billion, one hundred fifty million, one thousand, five hundred thirteen".

Divisors: 1 68791 1528543 105150001513