Search a number
-
+
13071104851200 = 283521161889701
BaseRepresentation
bin1011111000110101101010…
…0011111011110100000000
31201021120210202211020001220
42332031122203323310000
53203124110320214300
643444441020155040
72516233110020514
oct276153243736400
951246722736056
1013071104851200
11418a473a1a930
121571326698a80
1373a7a4c91876
14332905680144
1517a021c8ada0
hexbe35a8fbd00

13071104851200 has 216 divisors, whose sum is σ = 47058948930336. Its totient is φ = 3168752640000.

The previous prime is 13071104851159. The next prime is 13071104851201. The reversal of 13071104851200 is 215840117031.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30733651 + ... + 31156050.

Almost surely, 213071104851200 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

Adding to 13071104851200 its reverse (215840117031), we get a palindrome (13286944968231).

The spelling of 13071104851200 in words is "thirteen trillion, seventy-one billion, one hundred four million, eight hundred fifty-one thousand, two hundred".