Base | Representation |
---|---|
bin | 111101001100000110… |
… | …1001001110000101111 |
3 | 110120011200011220000002 |
4 | 1322120031021300233 |
5 | 4123103031303232 |
6 | 140210541454515 |
7 | 12331164462404 |
oct | 1723015116057 |
9 | 416150156002 |
10 | 131402603567 |
11 | 50800386a34 |
12 | 2157257143b |
13 | c511655381 |
14 | 65078982ab |
15 | 364106eb62 |
hex | 1e98349c2f |
131402603567 has 2 divisors, whose sum is σ = 131402603568. Its totient is φ = 131402603566.
The previous prime is 131402603539. The next prime is 131402603573. The reversal of 131402603567 is 765306204131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131402603567 - 210 = 131402602543 is a prime.
It is a super-2 number, since 2×1314026035672 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131402603567.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131402603537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65701301783 + 65701301784.
It is an arithmetic number, because the mean of its divisors is an integer number (65701301784).
Almost surely, 2131402603567 is an apocalyptic number.
131402603567 is a deficient number, since it is larger than the sum of its proper divisors (1).
131402603567 is an equidigital number, since it uses as much as digits as its factorization.
131402603567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 131402603567 its reverse (765306204131), we get a palindrome (896708807698).
The spelling of 131402603567 in words is "one hundred thirty-one billion, four hundred two million, six hundred three thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •