Base | Representation |
---|---|
bin | 1000000000110000100… |
… | …1000001110011100011 |
3 | 111011021112220221000202 |
4 | 2000030021001303203 |
5 | 4223343004144010 |
6 | 143122051335415 |
7 | 12641625123215 |
oct | 2001411016343 |
9 | 434245827022 |
10 | 137642646755 |
11 | 5341275a819 |
12 | 228142b156b |
13 | cc97388813 |
14 | 693a5105b5 |
15 | 38a8cc16a5 |
hex | 200c241ce3 |
137642646755 has 8 divisors (see below), whose sum is σ = 169012366512. Its totient is φ = 107553323808.
The previous prime is 137642646733. The next prime is 137642646767. The reversal of 137642646755 is 557646246731.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 137642646755 - 210 = 137642645731 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 137642646755.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 320098964 + ... + 320099393.
It is an arithmetic number, because the mean of its divisors is an integer number (21126545814).
Almost surely, 2137642646755 is an apocalyptic number.
137642646755 is a deficient number, since it is larger than the sum of its proper divisors (31369719757).
137642646755 is an equidigital number, since it uses as much as digits as its factorization.
137642646755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640198405.
The product of its digits is 25401600, while the sum is 56.
The spelling of 137642646755 in words is "one hundred thirty-seven billion, six hundred forty-two million, six hundred forty-six thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •