Search a number
-
+
13050940543 = 411601198823
BaseRepresentation
bin11000010011110010…
…11000110001111111
31020200112122110202021
430021321120301333
5203212020044133
65555010541011
7641262110224
oct141171306177
936615573667
1013050940543
115597a08883
122642897767
1312ccac9234
148bb42994b
15515b6552d
hex309e58c7f

13050940543 has 8 divisors (see below), whose sum is σ = 13377674016. Its totient is φ = 12724608000.

The previous prime is 13050940517. The next prime is 13050940547. The reversal of 13050940543 is 34504905031.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 13050940543 - 29 = 13050940031 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 13050940499 and 13050940508.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13050940547) 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 7 ways as a sum of consecutive naturals, for example, 33771 + ... + 165052.

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

Almost surely, 213050940543 is an apocalyptic number.

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

13050940543 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 200465.

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

The spelling of 13050940543 in words is "thirteen billion, fifty million, nine hundred forty thousand, five hundred forty-three".

Divisors: 1 41 1601 65641 198823 8151743 318315623 13050940543