Base | Representation |
---|---|
bin | 10000001101011… |
… | …10011000011101 |
3 | 100110212112021112 |
4 | 20012232120131 |
5 | 234302334243 |
6 | 21254311405 |
7 | 3240546551 |
oct | 1006563035 |
9 | 313775245 |
10 | 135980573 |
11 | 6a837243 |
12 | 39658565 |
13 | 222309a1 |
14 | 140b9861 |
15 | be10818 |
hex | 81ae61d |
135980573 has 2 divisors, whose sum is σ = 135980574. Its totient is φ = 135980572.
The previous prime is 135980561. The next prime is 135980591. The reversal of 135980573 is 375089531.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 133587364 + 2393209 = 11558^2 + 1547^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135980573 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 135980573.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135985573) 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, 67990286 + 67990287.
It is an arithmetic number, because the mean of its divisors is an integer number (67990287).
Almost surely, 2135980573 is an apocalyptic number.
It is an amenable number.
135980573 is a deficient number, since it is larger than the sum of its proper divisors (1).
135980573 is an equidigital number, since it uses as much as digits as its factorization.
135980573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 41.
The square root of 135980573 is about 11661.0708341901. The cubic root of 135980573 is about 514.2318305502.
The spelling of 135980573 in words is "one hundred thirty-five million, nine hundred eighty thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •