Base | Representation |
---|---|
bin | 10000010101101… |
… | …01110010001101 |
3 | 100112220100020122 |
4 | 20022311302031 |
5 | 240041400334 |
6 | 21333354325 |
7 | 3252662201 |
oct | 1012656215 |
9 | 315810218 |
10 | 137059469 |
11 | 70403898 |
12 | 39a989a5 |
13 | 2251aaa1 |
14 | 142bab01 |
15 | c07532e |
hex | 82b5c8d |
137059469 has 2 divisors, whose sum is σ = 137059470. Its totient is φ = 137059468.
The previous prime is 137059441. The next prime is 137059493. The reversal of 137059469 is 964950731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107226025 + 29833444 = 10355^2 + 5462^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-137059469 is a prime.
It is a super-2 number, since 2×1370594692 = 37570596085123922, which contains 22 as substring.
It is equal to p7755389 and since 137059469 and 7755389 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137059409) 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, 68529734 + 68529735.
It is an arithmetic number, because the mean of its divisors is an integer number (68529735).
Almost surely, 2137059469 is an apocalyptic number.
It is an amenable number.
137059469 is a deficient number, since it is larger than the sum of its proper divisors (1).
137059469 is an equidigital number, since it uses as much as digits as its factorization.
137059469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 204120, while the sum is 44.
The square root of 137059469 is about 11707.2400248735. The cubic root of 137059469 is about 515.5882541993.
The spelling of 137059469 in words is "one hundred thirty-seven million, fifty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •