Base | Representation |
---|---|
bin | 10000011001111… |
… | …01101111101001 |
3 | 100120221122011021 |
4 | 20030331233221 |
5 | 240212210421 |
6 | 21353332441 |
7 | 3260501611 |
oct | 1014755751 |
9 | 316848137 |
10 | 137616361 |
11 | 70754233 |
12 | 3a107121 |
13 | 226843cc |
14 | 143c3a41 |
15 | c135341 |
hex | 833dbe9 |
137616361 has 3 divisors (see below), whose sum is σ = 137628093. Its totient is φ = 137604630.
The previous prime is 137616359. The next prime is 137616371. The reversal of 137616361 is 163616731.
The square root of 137616361 is 11731.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 163616731 = 71 ⋅2304461.
It is not a de Polignac number, because 137616361 - 21 = 137616359 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (137616301) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 5866 + ... + 17596.
It is an arithmetic number, because the mean of its divisors is an integer number (45876031).
Almost surely, 2137616361 is an apocalyptic number.
137616361 is the 11731-st square number.
137616361 is the 5866-th centered octagonal number.
It is an amenable number.
137616361 is a deficient number, since it is larger than the sum of its proper divisors (11732).
137616361 is an frugal number, since it uses more digits than its factorization.
137616361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23462 (or 11731 counting only the distinct ones).
The product of its digits is 13608, while the sum is 34.
The cubic root of 137616361 is about 516.2856132178.
The spelling of 137616361 in words is "one hundred thirty-seven million, six hundred sixteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •