Base | Representation |
---|---|
bin | 1000000001001101101… |
… | …1111101110000110101 |
3 | 111011121002020201200210 |
4 | 2000103123331300311 |
5 | 4224120323121240 |
6 | 143142143100033 |
7 | 12644642421210 |
oct | 2002333756065 |
9 | 434532221623 |
10 | 137765051445 |
11 | 5347586421a |
12 | 228492a1619 |
13 | ccb6845128 |
14 | 694c894777 |
15 | 38b48ee780 |
hex | 20136fdc35 |
137765051445 has 32 divisors (see below), whose sum is σ = 251957587968. Its totient is φ = 62967221568.
The previous prime is 137765051423. The next prime is 137765051521. The reversal of 137765051445 is 544150567731.
137765051445 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 137765051445 - 211 = 137765049397 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 137765051394 and 137765051403.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 499252 + ... + 724418.
It is an arithmetic number, because the mean of its divisors is an integer number (7873674624).
Almost surely, 2137765051445 is an apocalyptic number.
137765051445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
137765051445 is a deficient number, since it is larger than the sum of its proper divisors (114192536523).
137765051445 is a wasteful number, since it uses less digits than its factorization.
137765051445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231009.
The product of its (nonzero) digits is 1764000, while the sum is 48.
The spelling of 137765051445 in words is "one hundred thirty-seven billion, seven hundred sixty-five million, fifty-one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •