Base | Representation |
---|---|
bin | 10000011010011… |
… | …00011001101101 |
3 | 100121001200111211 |
4 | 20031030121231 |
5 | 240221121042 |
6 | 21354514421 |
7 | 3261141625 |
oct | 1015143155 |
9 | 317050454 |
10 | 137676397 |
11 | 70795351 |
12 | 3a135a11 |
13 | 226a5831 |
14 | 143db885 |
15 | c148017 |
hex | 834c66d |
137676397 has 2 divisors, whose sum is σ = 137676398. Its totient is φ = 137676396.
The previous prime is 137676389. The next prime is 137676437. The reversal of 137676397 is 793676731.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111112681 + 26563716 = 10541^2 + 5154^2 .
It is a cyclic number.
It is not a de Polignac number, because 137676397 - 23 = 137676389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 137676397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137676307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68838198 + 68838199.
It is an arithmetic number, because the mean of its divisors is an integer number (68838199).
Almost surely, 2137676397 is an apocalyptic number.
It is an amenable number.
137676397 is a deficient number, since it is larger than the sum of its proper divisors (1).
137676397 is an equidigital number, since it uses as much as digits as its factorization.
137676397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1000188, while the sum is 49.
The square root of 137676397 is about 11733.5585821182. The cubic root of 137676397 is about 516.3606799143.
It can be divided in two parts, 13767 and 6397, that added together give a square (20164 = 1422).
The spelling of 137676397 in words is "one hundred thirty-seven million, six hundred seventy-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •