Search a number
-
+
13050485061 = 34350161687
BaseRepresentation
bin11000010011101111…
…01001100101000101
31020200111210022221120
430021313221211011
5203211411010221
65554553104153
7641255202255
oct141167514505
936614708846
1013050485061
115597727649
1226426b8059
1312cc999b13
148bb34b965
15515ac55c6
hex309de9945

13050485061 has 4 divisors (see below), whose sum is σ = 17400646752. Its totient is φ = 8700323372.

The previous prime is 13050485009. The next prime is 13050485099. The reversal of 13050485061 is 16058405031.

13050485061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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.

It is a cyclic number.

It is not a de Polignac number, because 13050485061 - 29 = 13050484549 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13050480061) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2175080841 + ... + 2175080846.

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

Almost surely, 213050485061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4350161690.

The product of its (nonzero) digits is 14400, while the sum is 33.

The spelling of 13050485061 in words is "thirteen billion, fifty million, four hundred eighty-five thousand, sixty-one".

Divisors: 1 3 4350161687 13050485061