Base | Representation |
---|---|
bin | 10000100011110… |
… | …10110101100001 |
3 | 100200101121210021 |
4 | 20101322311201 |
5 | 241030241134 |
6 | 21441233441 |
7 | 3304521331 |
oct | 1021726541 |
9 | 320347707 |
10 | 138915169 |
11 | 71461028 |
12 | 3a632881 |
13 | 22a1a633 |
14 | 146410c1 |
15 | c2e00b4 |
hex | 847ad61 |
138915169 has 2 divisors, whose sum is σ = 138915170. Its totient is φ = 138915168.
The previous prime is 138915163. The next prime is 138915209. The reversal of 138915169 is 961519831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77088400 + 61826769 = 8780^2 + 7863^2 .
It is a cyclic number.
It is not a de Polignac number, because 138915169 - 211 = 138913121 is a prime.
It is a super-2 number, since 2×1389151692 = 38594848356597122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (138915163) 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, 69457584 + 69457585.
It is an arithmetic number, because the mean of its divisors is an integer number (69457585).
Almost surely, 2138915169 is an apocalyptic number.
It is an amenable number.
138915169 is a deficient number, since it is larger than the sum of its proper divisors (1).
138915169 is an equidigital number, since it uses as much as digits as its factorization.
138915169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 58320, while the sum is 43.
The square root of 138915169 is about 11786.2279377246. The cubic root of 138915169 is about 517.9047456319.
The spelling of 138915169 in words is "one hundred thirty-eight million, nine hundred fifteen thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •