Base | Representation |
---|---|
bin | 10000010101100… |
… | …01111001110001 |
3 | 100112212112102202 |
4 | 20022301321301 |
5 | 240040343234 |
6 | 21333152545 |
7 | 3252564635 |
oct | 1012617161 |
9 | 315775382 |
10 | 137043569 |
11 | 703a2953 |
12 | 39a8b755 |
13 | 22513790 |
14 | 142b4dc5 |
15 | c07077e |
hex | 82b1e71 |
137043569 has 4 divisors (see below), whose sum is σ = 147585396. Its totient is φ = 126501744.
The previous prime is 137043563. The next prime is 137043593. The reversal of 137043569 is 965340731.
It is a happy number.
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 40768225 + 96275344 = 6385^2 + 9812^2 .
It is a cyclic number.
It is not a de Polignac number, because 137043569 - 24 = 137043553 is a prime.
It is a super-2 number, since 2×1370435692 = 37561879608515522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (137043563) 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, 5270894 + ... + 5270919.
It is an arithmetic number, because the mean of its divisors is an integer number (36896349).
Almost surely, 2137043569 is an apocalyptic number.
It is an amenable number.
137043569 is a deficient number, since it is larger than the sum of its proper divisors (10541827).
137043569 is a wasteful number, since it uses less digits than its factorization.
137043569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10541826.
The product of its (nonzero) digits is 68040, while the sum is 38.
The square root of 137043569 is about 11706.5609382090. The cubic root of 137043569 is about 515.5683159678.
The spelling of 137043569 in words is "one hundred thirty-seven million, forty-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •