Base | Representation |
---|---|
bin | 10000011000101… |
… | …10100110101101 |
3 | 100120122111020122 |
4 | 20030112212231 |
5 | 240142043140 |
6 | 21350054325 |
7 | 3256233326 |
oct | 1014264655 |
9 | 316574218 |
10 | 137456045 |
11 | 70654841 |
12 | 3a04a3a5 |
13 | 2262944c |
14 | 1438144d |
15 | c102ab5 |
hex | 83169ad |
137456045 has 4 divisors (see below), whose sum is σ = 164947260. Its totient is φ = 109964832.
The previous prime is 137456009. The next prime is 137456047. The reversal of 137456045 is 540654731.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 75030244 + 62425801 = 8662^2 + 7901^2 .
It is a cyclic number.
It is not a de Polignac number, because 137456045 - 28 = 137455789 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 137455996 and 137456014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137456047) 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 in 3 ways as a sum of consecutive naturals, for example, 13745600 + ... + 13745609.
It is an arithmetic number, because the mean of its divisors is an integer number (41236815).
Almost surely, 2137456045 is an apocalyptic number.
It is an amenable number.
137456045 is a deficient number, since it is larger than the sum of its proper divisors (27491215).
137456045 is an equidigital number, since it uses as much as digits as its factorization.
137456045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27491214.
The product of its (nonzero) digits is 50400, while the sum is 35.
The square root of 137456045 is about 11724.1650022507. The cubic root of 137456045 is about 516.0850532333.
The spelling of 137456045 in words is "one hundred thirty-seven million, four hundred fifty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •