Base | Representation |
---|---|
bin | 11101110101101011100000… |
… | …101111101000000101000101 |
3 | 122012122200020202020010102202 |
4 | 131311223200233220011011 |
5 | 114200102022020441201 |
6 | 1143035124021044245 |
7 | 36433133200256042 |
oct | 3565534057500505 |
9 | 565580222203382 |
10 | 131232201343301 |
11 | 388a629a495133 |
12 | 1287581a856685 |
13 | 582c1b3316b86 |
14 | 245995b23c1c9 |
15 | 10289b6292c6b |
hex | 775ae0be8145 |
131232201343301 has 8 divisors (see below), whose sum is σ = 133988175064800. Its totient is φ = 128493950926000.
The previous prime is 131232201343289. The next prime is 131232201343367. The reversal of 131232201343301 is 103343102232131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131232201343301 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 (131232201343801) 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, 4430811086 + ... + 4430840703.
It is an arithmetic number, because the mean of its divisors is an integer number (16748521883100).
Almost surely, 2131232201343301 is an apocalyptic number.
It is an amenable number.
131232201343301 is a deficient number, since it is larger than the sum of its proper divisors (2755973721499).
131232201343301 is an equidigital number, since it uses as much as digits as its factorization.
131232201343301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8861652099.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 131232201343301 its reverse (103343102232131), we get a palindrome (234575303575432).
The spelling of 131232201343301 in words is "one hundred thirty-one trillion, two hundred thirty-two billion, two hundred one million, three hundred forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •