Base | Representation |
---|---|
bin | 10000101001001… |
… | …10100010100101 |
3 | 100201201100112102 |
4 | 20110212202211 |
5 | 241220242334 |
6 | 21504301445 |
7 | 3313510634 |
oct | 1024464245 |
9 | 321640472 |
10 | 139618469 |
11 | 718a1471 |
12 | 3a911885 |
13 | 22c057a3 |
14 | 1478551b |
15 | c3cd67e |
hex | 85268a5 |
139618469 has 2 divisors, whose sum is σ = 139618470. Its totient is φ = 139618468.
The previous prime is 139618429. The next prime is 139618471. The reversal of 139618469 is 964816931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111049444 + 28569025 = 10538^2 + 5345^2 .
It is a cyclic number.
It is not a de Polignac number, because 139618469 - 212 = 139614373 is a prime.
It is a super-2 number, since 2×1396184692 = 38986633771807922, which contains 22 as substring.
Together with 139618471, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139618429) 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, 69809234 + 69809235.
It is an arithmetic number, because the mean of its divisors is an integer number (69809235).
Almost surely, 2139618469 is an apocalyptic number.
It is an amenable number.
139618469 is a deficient number, since it is larger than the sum of its proper divisors (1).
139618469 is an equidigital number, since it uses as much as digits as its factorization.
139618469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 279936, while the sum is 47.
The square root of 139618469 is about 11816.0259393757. The cubic root of 139618469 is about 518.7772911756. Note that the first 3 decimals are identical.
The spelling of 139618469 in words is "one hundred thirty-nine million, six hundred eighteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •