Base | Representation |
---|---|
bin | 10000010110111… |
… | …00000100100101 |
3 | 100120012022100221 |
4 | 20023130010211 |
5 | 240111410133 |
6 | 21341004341 |
7 | 3254214334 |
oct | 1013340445 |
9 | 316168327 |
10 | 137216293 |
11 | 705006a5 |
12 | 39b536b1 |
13 | 22574296 |
14 | 1431bd1b |
15 | c0a6a2d |
hex | 82dc125 |
137216293 has 2 divisors, whose sum is σ = 137216294. Its totient is φ = 137216292.
The previous prime is 137216269. The next prime is 137216327. The reversal of 137216293 is 392612731.
It is an a-pointer prime, because the next prime (137216327) can be obtained adding 137216293 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97752769 + 39463524 = 9887^2 + 6282^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-137216293 is a prime.
It is a super-2 number, since 2×1372162932 = 37656622129323698, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137216203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68608146 + 68608147.
It is an arithmetic number, because the mean of its divisors is an integer number (68608147).
Almost surely, 2137216293 is an apocalyptic number.
It is an amenable number.
137216293 is a deficient number, since it is larger than the sum of its proper divisors (1).
137216293 is an equidigital number, since it uses as much as digits as its factorization.
137216293 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13608, while the sum is 34.
The square root of 137216293 is about 11713.9358458206. The cubic root of 137216293 is about 515.7848253026.
The spelling of 137216293 in words is "one hundred thirty-seven million, two hundred sixteen thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •