Base | Representation |
---|---|
bin | 1000011011010… |
… | …10000101101101 |
3 | 11221000101021001 |
4 | 10031222011231 |
5 | 121044023013 |
6 | 11003040301 |
7 | 1515563524 |
oct | 415520555 |
9 | 157011231 |
10 | 70689133 |
11 | 369a1879 |
12 | 1b810091 |
13 | 118503b8 |
14 | 95614bb |
15 | 6314ddd |
hex | 436a16d |
70689133 has 2 divisors, whose sum is σ = 70689134. Its totient is φ = 70689132.
The previous prime is 70689109. The next prime is 70689137. The reversal of 70689133 is 33198607.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55920484 + 14768649 = 7478^2 + 3843^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-70689133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 70689092 and 70689101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (70689137) 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, 35344566 + 35344567.
It is an arithmetic number, because the mean of its divisors is an integer number (35344567).
Almost surely, 270689133 is an apocalyptic number.
It is an amenable number.
70689133 is a deficient number, since it is larger than the sum of its proper divisors (1).
70689133 is an equidigital number, since it uses as much as digits as its factorization.
70689133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 70689133 is about 8407.6829745180. The cubic root of 70689133 is about 413.4765510609.
The spelling of 70689133 in words is "seventy million, six hundred eighty-nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •