Base | Representation |
---|---|
bin | 1000000000111110111… |
… | …0011110111001011101 |
3 | 111011102202002212111122 |
4 | 2000033232132321131 |
5 | 4224003404000033 |
6 | 143132040500325 |
7 | 12643255314104 |
oct | 2001756367135 |
9 | 434382085448 |
10 | 137702796893 |
11 | 53443703482 |
12 | 2283047a6a5 |
13 | cca6988c0c |
14 | 69444cb03b |
15 | 38ae203a98 |
hex | 200fb9ee5d |
137702796893 has 8 divisors (see below), whose sum is σ = 139956890040. Its totient is φ = 135464412160.
The previous prime is 137702796809. The next prime is 137702796919. The reversal of 137702796893 is 398697207731.
It can be written as a sum of positive squares in 4 ways, for example, as 12430689049 + 125272107844 = 111493^2 + 353938^2 .
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 137702796893 - 216 = 137702731357 is a prime.
It is a super-3 number, since 3×1377027968933 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137702792893) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3909428 + ... + 3944493.
It is an arithmetic number, because the mean of its divisors is an integer number (17494611255).
Almost surely, 2137702796893 is an apocalyptic number.
It is an amenable number.
137702796893 is a deficient number, since it is larger than the sum of its proper divisors (2254093147).
137702796893 is an equidigital number, since it uses as much as digits as its factorization.
137702796893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7854207.
The product of its (nonzero) digits is 24004512, while the sum is 62.
The spelling of 137702796893 in words is "one hundred thirty-seven billion, seven hundred two million, seven hundred ninety-six thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •