Base | Representation |
---|---|
bin | 1000000101001000111… |
… | …1000110111010011100 |
3 | 111021022111202212020202 |
4 | 2001102033012322130 |
5 | 4233300033130120 |
6 | 143434501203032 |
7 | 13013025006362 |
oct | 2012217067234 |
9 | 437274685222 |
10 | 138818645660 |
11 | 53966563142 |
12 | 22aa2100478 |
13 | 10123bc8666 |
14 | 6a0c793632 |
15 | 392716a875 |
hex | 20523c6e9c |
138818645660 has 12 divisors (see below), whose sum is σ = 291519155928. Its totient is φ = 55527458256.
The previous prime is 138818645627. The next prime is 138818645663. The reversal of 138818645660 is 66546818831.
It is a junction number, because it is equal to n+sod(n) for n = 138818645596 and 138818645605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138818645663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3470466122 + ... + 3470466161.
It is an arithmetic number, because the mean of its divisors is an integer number (24293262994).
Almost surely, 2138818645660 is an apocalyptic number.
138818645660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
138818645660 is an abundant number, since it is smaller than the sum of its proper divisors (152700510268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138818645660 is a wasteful number, since it uses less digits than its factorization.
138818645660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6940932292 (or 6940932290 counting only the distinct ones).
The product of its (nonzero) digits is 6635520, while the sum is 56.
The spelling of 138818645660 in words is "one hundred thirty-eight billion, eight hundred eighteen million, six hundred forty-five thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •