Base | Representation |
---|---|
bin | 111111111100011100… |
… | …1110110100100110001 |
3 | 111010110001121202202101 |
4 | 1333320321312210301 |
5 | 4222212343321424 |
6 | 143030042020401 |
7 | 12630625622011 |
oct | 1777071664461 |
9 | 433401552671 |
10 | 137319901489 |
11 | 532675604a1 |
12 | 227441a7701 |
13 | cc45555ba4 |
14 | 69096d9c41 |
15 | 388a7bd344 |
hex | 1ff8e76931 |
137319901489 has 9 divisors (see below), whose sum is σ = 137941916203. Its totient is φ = 136700684032.
The previous prime is 137319901487. The next prime is 137319901507. The reversal of 137319901489 is 984109913731.
The square root of 137319901489 is 370567.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1748661489 + 135571240000 = 41817^2 + 368200^2 .
It is not a de Polignac number, because 137319901489 - 21 = 137319901487 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (137319901487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 97458417 + ... + 97459825.
Almost surely, 2137319901489 is an apocalyptic number.
137319901489 is the 370567-th square number.
137319901489 is the 185284-th centered octagonal number.
It is an amenable number.
137319901489 is a deficient number, since it is larger than the sum of its proper divisors (622014714).
137319901489 is an frugal number, since it uses more digits than its factorization.
137319901489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3344 (or 1672 counting only the distinct ones).
The product of its (nonzero) digits is 1469664, while the sum is 55.
The spelling of 137319901489 in words is "one hundred thirty-seven billion, three hundred nineteen million, nine hundred one thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •