Search a number
-
+
13146701568 = 283731113349
BaseRepresentation
bin11000011111001101…
…01011111100000000
31020221012211122011220
430033212223330000
5203411023422233
610012311235040
7643534056000
oct141746537400
936835748156
1013146701568
115636a74520
12266a978a80
1313168b7470
148ca036000
1551e27deb3
hex30f9abf00

13146701568 has 576 divisors, whose sum is σ = 48074880000. Its totient is φ = 3143024640.

The previous prime is 13146701567. The next prime is 13146701627. The reversal of 13146701568 is 86510764131.

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

It is a Harshad number since it is a multiple of its sum of digits (42).

It is a congruent number.

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

Almost surely, 213146701568 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 120960, while the sum is 42.

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