Search a number
-
+
131045251531235 = 559874377659981
BaseRepresentation
bin11101110010111101011001…
…101010101100000111100011
3122011222210200220011200022012
4131302331121222230013203
5114134021133342444420
61142413205113503135
736413464332136136
oct3562753152540743
9564883626150265
10131045251531235
1138833a85168318
1212845545711aab
13581768b8bc4c2
1424508a442c21d
151023bc3885dc5
hex772f59aac1e3

131045251531235 has 8 divisors (see below), whose sum is σ = 157280567833296. Its totient is φ = 104818690561120.

The previous prime is 131045251531169. The next prime is 131045251531273. The reversal of 131045251531235 is 532135152540131.

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

It is not a de Polignac number, because 131045251531235 - 224 = 131045234754019 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 131045251531192 and 131045251531201.

It is an unprimeable number.

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

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

Almost surely, 2131045251531235 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4377665973.

The product of its (nonzero) digits is 270000, while the sum is 41.

The spelling of 131045251531235 in words is "one hundred thirty-one trillion, forty-five billion, two hundred fifty-one million, five hundred thirty-one thousand, two hundred thirty-five".

Divisors: 1 5 5987 29935 4377659981 21888299905 26209050306247 131045251531235