Base | Representation |
---|---|
bin | 10000011110111… |
… | …01100001101101 |
3 | 100122011212220211 |
4 | 20033131201231 |
5 | 240344131304 |
6 | 21415342421 |
7 | 3266165644 |
oct | 1017354155 |
9 | 318155824 |
10 | 138270829 |
11 | 71060a14 |
12 | 3a381a11 |
13 | 22853278 |
14 | 1451435b |
15 | c214204 |
hex | 83dd86d |
138270829 has 2 divisors, whose sum is σ = 138270830. Its totient is φ = 138270828.
The previous prime is 138270817. The next prime is 138270841. The reversal of 138270829 is 928072831.
It is a balanced prime because it is at equal distance from previous prime (138270817) and next prime (138270841).
It can be written as a sum of positive squares in only one way, i.e., 136936804 + 1334025 = 11702^2 + 1155^2 .
It is a cyclic number.
It is not a de Polignac number, because 138270829 - 27 = 138270701 is a prime.
It is a Chen prime.
It is equal to p7819816 and since 138270829 and 7819816 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 = 138270791 and 138270800.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138270329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69135414 + 69135415.
It is an arithmetic number, because the mean of its divisors is an integer number (69135415).
Almost surely, 2138270829 is an apocalyptic number.
It is an amenable number.
138270829 is a deficient number, since it is larger than the sum of its proper divisors (1).
138270829 is an equidigital number, since it uses as much as digits as its factorization.
138270829 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 40.
The square root of 138270829 is about 11758.8617221226. The cubic root of 138270829 is about 517.1027597108.
The spelling of 138270829 in words is "one hundred thirty-eight million, two hundred seventy thousand, eight hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •