Base | Representation |
---|---|
bin | 1000000101010001000… |
… | …0110100000010000110 |
3 | 111021101212202022101100 |
4 | 2001110100310002012 |
5 | 4233332234201141 |
6 | 143442114040530 |
7 | 13013620011651 |
oct | 2012420640206 |
9 | 437355668340 |
10 | 138852647046 |
11 | 53983776963 |
12 | 22ab1579146 |
13 | 1012ac71a19 |
14 | 6a130c4898 |
15 | 392a1350b6 |
hex | 2054434086 |
138852647046 has 12 divisors (see below), whose sum is σ = 300847401972. Its totient is φ = 46284215676.
The previous prime is 138852646957. The next prime is 138852647071. The reversal of 138852647046 is 640746258831.
It is a happy number.
138852647046 is a `hidden beast` number, since 1 + 3 + 8 + 8 + 526 + 4 + 70 + 46 = 666.
It is a super-2 number, since 2×1388526470462 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 138852646983 and 138852647001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3857017956 + ... + 3857017991.
It is an arithmetic number, because the mean of its divisors is an integer number (25070616831).
Almost surely, 2138852647046 is an apocalyptic number.
138852647046 is an abundant number, since it is smaller than the sum of its proper divisors (161994754926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138852647046 is a wasteful number, since it uses less digits than its factorization.
138852647046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7714035955 (or 7714035952 counting only the distinct ones).
The product of its (nonzero) digits is 7741440, while the sum is 54.
The spelling of 138852647046 in words is "one hundred thirty-eight billion, eight hundred fifty-two million, six hundred forty-seven thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •