Search a number
-
+
13010500642 = 242115451901
BaseRepresentation
bin11000001110111110…
…00111110000100010
31020120201112220122011
430013133013300202
5203121142010032
65551004103134
7640261300516
oct140737076042
936521486564
1013010500642
1155770a7777
122631234aaa
1312c460a3b9
148b5d00146
15512328247
hex3077c7c22

13010500642 has 8 divisors (see below), whose sum is σ = 19562107932. Its totient is φ = 6489798000.

The previous prime is 13010500543. The next prime is 13010500697. The reversal of 13010500642 is 24600501031.

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

It can be written as a sum of positive squares in 2 ways, for example, as 9437928201 + 3572572441 = 97149^2 + 59771^2 .

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

It is an unprimeable number.

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, 7725109 + ... + 7726792.

Almost surely, 213010500642 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15452324.

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

The spelling of 13010500642 in words is "thirteen billion, ten million, five hundred thousand, six hundred forty-two".

Divisors: 1 2 421 842 15451901 30903802 6505250321 13010500642