Base | Representation |
---|---|
bin | 111101001100011001… |
… | …0000001000101100111 |
3 | 110120012100100212020121 |
4 | 1322120302001011213 |
5 | 4123113020023432 |
6 | 140211524542411 |
7 | 12331342561633 |
oct | 1723062010547 |
9 | 416170325217 |
10 | 131412267367 |
11 | 50805887547 |
12 | 21575851a07 |
13 | c513659bb4 |
14 | 6508c91dc3 |
15 | 3641d2d197 |
hex | 1e98c81167 |
131412267367 has 2 divisors, whose sum is σ = 131412267368. Its totient is φ = 131412267366.
The previous prime is 131412267319. The next prime is 131412267377. The reversal of 131412267367 is 763762214131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131412267367 is a prime.
It is a super-2 number, since 2×1314122673672 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131412267377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65706133683 + 65706133684.
It is an arithmetic number, because the mean of its divisors is an integer number (65706133684).
Almost surely, 2131412267367 is an apocalyptic number.
131412267367 is a deficient number, since it is larger than the sum of its proper divisors (1).
131412267367 is an equidigital number, since it uses as much as digits as its factorization.
131412267367 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 254016, while the sum is 43.
The spelling of 131412267367 in words is "one hundred thirty-one billion, four hundred twelve million, two hundred sixty-seven thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •