Base | Representation |
---|---|
bin | 11111100011000001011100… |
… | …001001110110110010000000 |
3 | 200012021000010010011200001201 |
4 | 133203001130021312302000 |
5 | 121141204123410230121 |
6 | 1211031035502310544 |
7 | 41140036265630335 |
oct | 3743013411666200 |
9 | 605230103150051 |
10 | 138746169617536 |
11 | 40232a1370a068 |
12 | 13689b2b588454 |
13 | 5c559279417a0 |
14 | 26394c987298c |
15 | 110918da3ce91 |
hex | 7e305c276c80 |
138746169617536 has 64 divisors (see below), whose sum is σ = 298722408707520. Its totient is φ = 63810415383552.
The previous prime is 138746169617521. The next prime is 138746169617557. The reversal of 138746169617536 is 635716961647831.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1387461696175362 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146845540 + ... + 147787363.
It is an arithmetic number, because the mean of its divisors is an integer number (4667537636055).
Almost surely, 2138746169617536 is an apocalyptic number.
138746169617536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
138746169617536 is an abundant number, since it is smaller than the sum of its proper divisors (159976239089984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138746169617536 is a wasteful number, since it uses less digits than its factorization.
138746169617536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294633213 (or 294633201 counting only the distinct ones).
The product of its digits is 823011840, while the sum is 73.
The spelling of 138746169617536 in words is "one hundred thirty-eight trillion, seven hundred forty-six billion, one hundred sixty-nine million, six hundred seventeen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •