Base | Representation |
---|---|
bin | 11101110101100011001111… |
… | …011101000000001001111111 |
3 | 122012121211022212212220011122 |
4 | 131311203033131000021333 |
5 | 114144430330224021134 |
6 | 1143031054523141155 |
7 | 36432400142254412 |
oct | 3565431735001177 |
9 | 565554285786148 |
10 | 131223321313919 |
11 | 388a255299567a |
12 | 12873b609747bb |
13 | 582b3c9680313 |
14 | 2459357b35b79 |
15 | 10286468b302e |
hex | 7758cf74027f |
131223321313919 has 2 divisors, whose sum is σ = 131223321313920. Its totient is φ = 131223321313918.
The previous prime is 131223321313837. The next prime is 131223321313951. The reversal of 131223321313919 is 919313123322131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131223321313919 is a prime.
It is a super-3 number, since 3×1312233213139193 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 131223321313919.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131223327313919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65611660656959 + 65611660656960.
It is an arithmetic number, because the mean of its divisors is an integer number (65611660656960).
Almost surely, 2131223321313919 is an apocalyptic number.
131223321313919 is a deficient number, since it is larger than the sum of its proper divisors (1).
131223321313919 is an equidigital number, since it uses as much as digits as its factorization.
131223321313919 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 157464, while the sum is 44.
The spelling of 131223321313919 in words is "one hundred thirty-one trillion, two hundred twenty-three billion, three hundred twenty-one million, three hundred thirteen thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •