Search a number
-
+
13271147568 = 243672337191
BaseRepresentation
bin11000101110000010…
…11010010000110000
31021020220000011000000
430113001122100300
5204134403210233
610032514430000
7646604615220
oct142701322060
937226004000
1013271147568
1156a0242658
1226a4592300
131336609c53
148dc78c080
1552a161d13
hex31705a430

13271147568 has 560 divisors, whose sum is σ = 47464390656. Its totient is φ = 3510397440.

The previous prime is 13271147537. The next prime is 13271147581. The reversal of 13271147568 is 86574117231.

13271147568 is a `hidden beast` number, since 1 + 3 + 2 + 71 + 14 + 7 + 568 = 666.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 69482353 + ... + 69482543.

Almost surely, 213271147568 is an apocalyptic number.

13271147568 is a gapful number since it is divisible by the number (18) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 13271147568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23732195328).

13271147568 is an abundant number, since it is smaller than the sum of its proper divisors (34193243088).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 284 (or 263 counting only the distinct ones).

The product of its digits is 282240, while the sum is 45.

The spelling of 13271147568 in words is "thirteen billion, two hundred seventy-one million, one hundred forty-seven thousand, five hundred sixty-eight".