Search a number
-
+
131106571015680 = 29325132291398353
BaseRepresentation
bin11101110011110110100000…
…100101111101011000000000
3122012012122222100121020102200
4131303312200211331120000
5114141022224140000210
61142501305515113200
736421065023145231
oct3563664045753000
9565178870536380
10131106571015680
1138857a91440597
12128553b9442800
1358203b1817200
142453840235088
1510255b1d770c0
hex773da097d600

131106571015680 has 1440 divisors, whose sum is σ = 512348049813600. Its totient is φ = 30931672891392.

The previous prime is 131106571015661. The next prime is 131106571015681. The reversal of 131106571015680 is 86510175601131.

131106571015680 is a `hidden beast` number, since 1 + 3 + 1 + 1 + 0 + 6 + 571 + 0 + 15 + 68 + 0 = 666.

It is a tau number, because it is divible by the number of its divisors (1440).

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

It is a congruent number.

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

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

Almost surely, 2131106571015680 is an apocalyptic number.

131106571015680 is a gapful number since it is divisible by the number (10) 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 131106571015680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (256174024906800).

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

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

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 45.

The spelling of 131106571015680 in words is "one hundred thirty-one trillion, one hundred six billion, five hundred seventy-one million, fifteen thousand, six hundred eighty".