Base | Representation |
---|---|
bin | 111111110111101100… |
… | …1110101000000000101 |
3 | 111010000221200220210012 |
4 | 1333233121311000011 |
5 | 4221401042331433 |
6 | 143002145440005 |
7 | 12623652053105 |
oct | 1775731650005 |
9 | 433027626705 |
10 | 137160511493 |
11 | 53195595425 |
12 | 226ba940005 |
13 | cc1b519c95 |
14 | 68d2489205 |
15 | 387b7d6848 |
hex | 1fef675005 |
137160511493 has 2 divisors, whose sum is σ = 137160511494. Its totient is φ = 137160511492.
The previous prime is 137160511441. The next prime is 137160511513. The reversal of 137160511493 is 394115061731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134851997284 + 2308514209 = 367222^2 + 48047^2 .
It is a cyclic number.
It is not a de Polignac number, because 137160511493 - 232 = 132865544197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 137160511493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137160513493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68580255746 + 68580255747.
It is an arithmetic number, because the mean of its divisors is an integer number (68580255747).
Almost surely, 2137160511493 is an apocalyptic number.
It is an amenable number.
137160511493 is a deficient number, since it is larger than the sum of its proper divisors (1).
137160511493 is an equidigital number, since it uses as much as digits as its factorization.
137160511493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 137160511493 in words is "one hundred thirty-seven billion, one hundred sixty million, five hundred eleven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •