Base | Representation |
---|---|
bin | 111111111100010111… |
… | …0100010110100001001 |
3 | 111010102212001011012100 |
4 | 1333320232202310021 |
5 | 4222211113440334 |
6 | 143025454304013 |
7 | 12630561464052 |
oct | 1777056426411 |
9 | 433385034170 |
10 | 137316936969 |
11 | 53265916183 |
12 | 227431b8009 |
13 | cc44a58734 |
14 | 6909167729 |
15 | 388a3d4c99 |
hex | 1ff8ba2d09 |
137316936969 has 27 divisors (see below), whose sum is σ = 199927973973. Its totient is φ = 90820544544.
The previous prime is 137316936919. The next prime is 137316936973. The reversal of 137316936969 is 969639613731.
The square root of 137316936969 is 370563.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 17046696969 + 120270240000 = 130563^2 + 346800^2 .
It is not a de Polignac number, because 137316936969 - 29 = 137316936457 is a prime.
It is a super-2 number, since 2×1373169369692 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (137316936919) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 165641247 + ... + 165642075.
Almost surely, 2137316936969 is an apocalyptic number.
137316936969 is the 370563-rd square number.
137316936969 is the 185282-nd centered octagonal number.
It is an amenable number.
137316936969 is a deficient number, since it is larger than the sum of its proper divisors (62611037004).
137316936969 is an frugal number, since it uses more digits than its factorization.
137316936969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1962 (or 981 counting only the distinct ones).
The product of its digits is 29760696, while the sum is 63.
The spelling of 137316936969 in words is "one hundred thirty-seven billion, three hundred sixteen million, nine hundred thirty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •