Base | Representation |
---|---|
bin | 10000100100110… |
… | …10011001110101 |
3 | 100200122012011011 |
4 | 20102122121311 |
5 | 241043410334 |
6 | 21444112221 |
7 | 3305600314 |
oct | 1022323165 |
9 | 320565134 |
10 | 139044469 |
11 | 7153a193 |
12 | 3a695671 |
13 | 22a64445 |
14 | 1467627b |
15 | c318564 |
hex | 849a675 |
139044469 has 2 divisors, whose sum is σ = 139044470. Its totient is φ = 139044468.
The previous prime is 139044463. The next prime is 139044491. The reversal of 139044469 is 964440931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120165444 + 18879025 = 10962^2 + 4345^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139044469 is a prime.
It is a super-2 number, since 2×1390444692 = 38666728718983922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139044463) 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, 69522234 + 69522235.
It is an arithmetic number, because the mean of its divisors is an integer number (69522235).
Almost surely, 2139044469 is an apocalyptic number.
It is an amenable number.
139044469 is a deficient number, since it is larger than the sum of its proper divisors (1).
139044469 is an equidigital number, since it uses as much as digits as its factorization.
139044469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 40.
The square root of 139044469 is about 11791.7118774163. The cubic root of 139044469 is about 518.0653815993.
The spelling of 139044469 in words is "one hundred thirty-nine million, forty-four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •