Base | Representation |
---|---|
bin | 11111001011010000101111… |
… | …100101010010100101010101 |
3 | 122222110220111000101022021002 |
4 | 133023100233211102211111 |
5 | 120432431102032341401 |
6 | 1203340555102033045 |
7 | 40611053146254131 |
oct | 3713205745224525 |
9 | 588426430338232 |
10 | 137113334262101 |
11 | 3a76349072109a |
12 | 13465596278785 |
13 | 5b679690c7962 |
14 | 25c046c3523c1 |
15 | 10cb97495ea6b |
hex | 7cb42f952955 |
137113334262101 has 8 divisors (see below), whose sum is σ = 137870218312704. Its totient is φ = 136356856599280.
The previous prime is 137113334262097. The next prime is 137113334262161. The reversal of 137113334262101 is 101262433311731.
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 137113334262101 - 22 = 137113334262097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137113334262161) 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, 100920281 + ... + 102269886.
It is an arithmetic number, because the mean of its divisors is an integer number (17233777289088).
Almost surely, 2137113334262101 is an apocalyptic number.
It is an amenable number.
137113334262101 is a deficient number, since it is larger than the sum of its proper divisors (756884050603).
137113334262101 is a wasteful number, since it uses less digits than its factorization.
137113334262101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203193891.
The product of its (nonzero) digits is 54432, while the sum is 38.
Adding to 137113334262101 its reverse (101262433311731), we get a palindrome (238375767573832).
The spelling of 137113334262101 in words is "one hundred thirty-seven trillion, one hundred thirteen billion, three hundred thirty-four million, two hundred sixty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •