Base | Representation |
---|---|
bin | 11111011100111000110100… |
… | …110010101111001011100100 |
3 | 200010202200222101011201000112 |
4 | 133130320310302233023210 |
5 | 121112302241211410120 |
6 | 1210105240051032152 |
7 | 41064423412060643 |
oct | 3734706462571344 |
9 | 603680871151015 |
10 | 138324602450660 |
11 | 40090152a7200a |
12 | 1362029959b658 |
13 | 5c24c5304a452 |
14 | 2622d371dd35a |
15 | 10ed218a12bc5 |
hex | 7dce34caf2e4 |
138324602450660 has 24 divisors (see below), whose sum is σ = 290487037658496. Its totient is φ = 55328817644640.
The previous prime is 138324602450599. The next prime is 138324602450663. The reversal of 138324602450660 is 66054206423831.
It is a junction number, because it is equal to n+sod(n) for n = 138324602450599 and 138324602450608.
It is not an unprimeable number, because it can be changed into a prime (138324602450663) 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, 62849612 + ... + 65013251.
It is an arithmetic number, because the mean of its divisors is an integer number (12103626569104).
Almost surely, 2138324602450660 is an apocalyptic number.
138324602450660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
138324602450660 is an abundant number, since it is smaller than the sum of its proper divisors (152162435207836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138324602450660 is a wasteful number, since it uses less digits than its factorization.
138324602450660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127916963 (or 127916961 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 50.
The spelling of 138324602450660 in words is "one hundred thirty-eight trillion, three hundred twenty-four billion, six hundred two million, four hundred fifty thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •