Base | Representation |
---|---|
bin | 111111111101101100… |
… | …0011110111011111111 |
3 | 111010112221212110101102 |
4 | 1333323120132323333 |
5 | 4222304020014232 |
6 | 143034125203315 |
7 | 12631642235255 |
oct | 1777330367377 |
9 | 433487773342 |
10 | 137361485567 |
11 | 53288a831a9 |
12 | 2275610053b |
13 | cc51055757 |
14 | 69110425d5 |
15 | 388e284662 |
hex | 1ffb61eeff |
137361485567 has 2 divisors, whose sum is σ = 137361485568. Its totient is φ = 137361485566.
The previous prime is 137361485563. The next prime is 137361485593. The reversal of 137361485567 is 765584163731.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (765584163731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 137361485567 - 22 = 137361485563 is a prime.
It is a super-2 number, since 2×1373614855672 (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 (137361485563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68680742783 + 68680742784.
It is an arithmetic number, because the mean of its divisors is an integer number (68680742784).
Almost surely, 2137361485567 is an apocalyptic number.
137361485567 is a deficient number, since it is larger than the sum of its proper divisors (1).
137361485567 is an equidigital number, since it uses as much as digits as its factorization.
137361485567 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12700800, while the sum is 56.
The spelling of 137361485567 in words is "one hundred thirty-seven billion, three hundred sixty-one million, four hundred eighty-five thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •