Base | Representation |
---|---|
bin | 10000100110000… |
… | …11100110110101 |
3 | 100200221202122211 |
4 | 20103003212311 |
5 | 241114310422 |
6 | 21451453421 |
7 | 3310202332 |
oct | 1023034665 |
9 | 320852584 |
10 | 139213237 |
11 | 71644a69 |
12 | 3a757271 |
13 | 22ac31c7 |
14 | 146bb989 |
15 | c34d577 |
hex | 84c39b5 |
139213237 has 2 divisors, whose sum is σ = 139213238. Its totient is φ = 139213236.
The previous prime is 139213229. The next prime is 139213259. The reversal of 139213237 is 732312931.
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., 71216721 + 67996516 = 8439^2 + 8246^2 .
It is a cyclic number.
It is not a de Polignac number, because 139213237 - 23 = 139213229 is a prime.
It is equal to p7870108 and since 139213237 and 7870108 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 139213199 and 139213208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139213267) 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, 69606618 + 69606619.
It is an arithmetic number, because the mean of its divisors is an integer number (69606619).
Almost surely, 2139213237 is an apocalyptic number.
It is an amenable number.
139213237 is a deficient number, since it is larger than the sum of its proper divisors (1).
139213237 is an equidigital number, since it uses as much as digits as its factorization.
139213237 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6804, while the sum is 31.
The square root of 139213237 is about 11798.8659200789. The cubic root of 139213237 is about 518.2749009191.
The spelling of 139213237 in words is "one hundred thirty-nine million, two hundred thirteen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •