Search a number
-
+
13149564569 = 293717596967
BaseRepresentation
bin11000011111100011…
…00110111010011001
31020221102020002110222
430033301212322121
5203412242031234
610012452445425
7643600311641
oct141761467231
936842202428
1013149564569
11563864a539
12266b919875
13131737a64b
148ca57d521
1551e64742e
hex30fc66e99

13149564569 has 16 divisors (see below), whose sum is σ = 13980595200. Its totient is φ = 12344197824.

The previous prime is 13149564557. The next prime is 13149564607. The reversal of 13149564569 is 96546594131.

It is a cyclic number.

It is not a de Polignac number, because 13149564569 - 220 = 13148515993 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 13149564569.

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

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

Almost surely, 213149564569 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8792.

The product of its digits is 3499200, while the sum is 53.

The spelling of 13149564569 in words is "thirteen billion, one hundred forty-nine million, five hundred sixty-four thousand, five hundred sixty-nine".

Divisors: 1 29 37 1073 1759 6967 51011 65083 202043 257779 1887407 7475591 12254953 355393637 453433261 13149564569