Base | Representation |
---|---|
bin | 11101110111010100111001… |
… | …000001010111111010000001 |
3 | 122020001111022101021200202201 |
4 | 131313110321001113322001 |
5 | 114203430234443242403 |
6 | 1143203115502313201 |
7 | 36444250153132336 |
oct | 3567247101277201 |
9 | 566044271250681 |
10 | 131345351540353 |
11 | 3893a283861985 |
12 | 12893738588801 |
13 | 5839a76365ab2 |
14 | 246121296498d |
15 | 102b8d9bec21d |
hex | 777539057e81 |
131345351540353 has 8 divisors (see below), whose sum is σ = 131820165612800. Its totient is φ = 130870542095280.
The previous prime is 131345351540323. The next prime is 131345351540383. The reversal of 131345351540353 is 353045153543131.
It is an interprime number because it is at equal distance from previous prime (131345351540323) and next prime (131345351540383).
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 131345351540353 - 25 = 131345351540321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131345351540303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61918768 + ... + 64004878.
It is an arithmetic number, because the mean of its divisors is an integer number (16477520701600).
Almost surely, 2131345351540353 is an apocalyptic number.
It is an amenable number.
131345351540353 is a deficient number, since it is larger than the sum of its proper divisors (474814072447).
131345351540353 is a wasteful number, since it uses less digits than its factorization.
131345351540353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2313687.
The product of its (nonzero) digits is 2430000, while the sum is 46.
The spelling of 131345351540353 in words is "one hundred thirty-one trillion, three hundred forty-five billion, three hundred fifty-one million, five hundred forty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •