Base | Representation |
---|---|
bin | 10000011000111… |
… | …10100100010001 |
3 | 100120201010222111 |
4 | 20030132210101 |
5 | 240144114112 |
6 | 21350505321 |
7 | 3256430365 |
oct | 1014364421 |
9 | 316633874 |
10 | 137488657 |
11 | 70677299 |
12 | 3a065241 |
13 | 2263b247 |
14 | 1438d2a5 |
15 | c10c5a7 |
hex | 831e911 |
137488657 has 2 divisors, whose sum is σ = 137488658. Its totient is φ = 137488656.
The previous prime is 137488649. The next prime is 137488669. The reversal of 137488657 is 756884731.
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., 137452176 + 36481 = 11724^2 + 191^2 .
It is an emirp because it is prime and its reverse (756884731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 137488657 - 23 = 137488649 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 137488657.
It is not a weakly prime, because it can be changed into another prime (137483657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68744328 + 68744329.
It is an arithmetic number, because the mean of its divisors is an integer number (68744329).
Almost surely, 2137488657 is an apocalyptic number.
It is an amenable number.
137488657 is a deficient number, since it is larger than the sum of its proper divisors (1).
137488657 is an equidigital number, since it uses as much as digits as its factorization.
137488657 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1128960, while the sum is 49.
The square root of 137488657 is about 11725.5557224381. Note that the first 3 decimals coincide. The cubic root of 137488657 is about 516.1258644247.
The spelling of 137488657 in words is "one hundred thirty-seven million, four hundred eighty-eight thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •