Search a number
-
+
131010056111023 = 653321762364923
BaseRepresentation
bin11101110010011100100111…
…110110110100001110101111
3122011212102212001210002020021
4131302130213312310032233
5114132432043331023043
61142345104445503011
736411110215041445
oct3562344766641657
9564772761702207
10131010056111023
1138820064282181
121283a762871a67
135814270055c7b
14244ccc5db2b95
151022d13aa33ed
hex772727db43af

131010056111023 has 8 divisors (see below), whose sum is σ = 131251472832528. Its totient is φ = 130768764127104.

The previous prime is 131010056110993. The next prime is 131010056111027. The reversal of 131010056111023 is 320111650010131.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 131010056111023 - 229 = 131009519240111 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29081761 + ... + 33283162.

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

Almost surely, 2131010056111023 is an apocalyptic number.

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

131010056111023 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 62368793.

The product of its (nonzero) digits is 540, while the sum is 25.

The spelling of 131010056111023 in words is "one hundred thirty-one trillion, ten billion, fifty-six million, one hundred eleven thousand, twenty-three".

Divisors: 1 653 3217 2100701 62364923 40724294719 200627957291 131010056111023