Base | Representation |
---|---|
bin | 11111001111110001100110… |
… | …111100000000110011010111 |
3 | 200000120120002001002100121120 |
4 | 133033301212330000303113 |
5 | 121003021312124021100 |
6 | 1204135252403215023 |
7 | 40642343311602141 |
oct | 3717614674006327 |
9 | 600516061070546 |
10 | 137423500610775 |
11 | 3a872a85520645 |
12 | 134b5718377473 |
13 | 5b8ac992180a2 |
14 | 25d1493759c91 |
15 | 10d4a798da0a0 |
hex | 7cfc66f00cd7 |
137423500610775 has 24 divisors (see below), whose sum is σ = 227228012845440. Its totient is φ = 73285708335840.
The previous prime is 137423500610771. The next prime is 137423500610813. The reversal of 137423500610775 is 577016005324731.
It is not a de Polignac number, because 137423500610775 - 22 = 137423500610771 is a prime.
It is a super-2 number, since 2×1374235006107752 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137423500610771) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 84505747 + ... + 86116596.
It is an arithmetic number, because the mean of its divisors is an integer number (9467833868560).
Almost surely, 2137423500610775 is an apocalyptic number.
137423500610775 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
137423500610775 is a deficient number, since it is larger than the sum of its proper divisors (89804512234665).
137423500610775 is a wasteful number, since it uses less digits than its factorization.
137423500610775 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170633095 (or 170633090 counting only the distinct ones).
The product of its (nonzero) digits is 3704400, while the sum is 51.
The spelling of 137423500610775 in words is "one hundred thirty-seven trillion, four hundred twenty-three billion, five hundred million, six hundred ten thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •