Base | Representation |
---|---|
bin | 10000100110000… |
… | …11001101111001 |
3 | 100200221200110201 |
4 | 20103003031321 |
5 | 241114233031 |
6 | 21451442201 |
7 | 3310164562 |
oct | 1023031571 |
9 | 320850421 |
10 | 139211641 |
11 | 71643848 |
12 | 3a756361 |
13 | 22ac256a |
14 | 146bb169 |
15 | c34cd61 |
hex | 84c3379 |
139211641 has 2 divisors, whose sum is σ = 139211642. Its totient is φ = 139211640.
The previous prime is 139211573. The next prime is 139211647. The reversal of 139211641 is 146112931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93026025 + 46185616 = 9645^2 + 6796^2 .
It is a cyclic number.
It is not a de Polignac number, because 139211641 - 29 = 139211129 is a prime.
It is equal to p7870024 and since 139211641 and 7870024 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (139211647) 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, 69605820 + 69605821.
It is an arithmetic number, because the mean of its divisors is an integer number (69605821).
Almost surely, 2139211641 is an apocalyptic number.
It is an amenable number.
139211641 is a deficient number, since it is larger than the sum of its proper divisors (1).
139211641 is an equidigital number, since it uses as much as digits as its factorization.
139211641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 28.
The square root of 139211641 is about 11798.7982862663. The cubic root of 139211641 is about 518.2729203366.
The spelling of 139211641 in words is "one hundred thirty-nine million, two hundred eleven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •