Base | Representation |
---|---|
bin | 11111001111100011111110… |
… | …111100010011100110100111 |
3 | 200000112011022110210212021202 |
4 | 133033203332330103212213 |
5 | 121002301331431033211 |
6 | 1204124432555033115 |
7 | 40641314626562555 |
oct | 3717437674234647 |
9 | 600464273725252 |
10 | 137408870955431 |
11 | 3a867858459a99 |
12 | 134b2914a3b79b |
13 | 5b897a73294aa |
14 | 25d08a67babd5 |
15 | 10d44c037c53b |
hex | 7cf8fef139a7 |
137408870955431 has 2 divisors, whose sum is σ = 137408870955432. Its totient is φ = 137408870955430.
The previous prime is 137408870955361. The next prime is 137408870955437. The reversal of 137408870955431 is 134559078804731.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-137408870955431 is a prime.
It is a super-3 number, since 3×1374088709554313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137408870955437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68704435477715 + 68704435477716.
It is an arithmetic number, because the mean of its divisors is an integer number (68704435477716).
Almost surely, 2137408870955431 is an apocalyptic number.
137408870955431 is a deficient number, since it is larger than the sum of its proper divisors (1).
137408870955431 is an equidigital number, since it uses as much as digits as its factorization.
137408870955431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 101606400, while the sum is 65.
The spelling of 137408870955431 in words is "one hundred thirty-seven trillion, four hundred eight billion, eight hundred seventy million, nine hundred fifty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •