Base | Representation |
---|---|
bin | 11111011110001001101… |
… | …00010111010110110001 |
3 | 10211101010100211021020012 |
4 | 33233010310113112301 |
5 | 120204040221242120 |
6 | 2144432112224305 |
7 | 141060404410352 |
oct | 17570464272661 |
9 | 3741110737205 |
10 | 1081338852785 |
11 | 387658656984 |
12 | 1556a223b095 |
13 | 7ac7b8bcc29 |
14 | 3a4a0d37d29 |
15 | 1d1dc54c1c5 |
hex | fbc4d175b1 |
1081338852785 has 4 divisors (see below), whose sum is σ = 1297606623348. Its totient is φ = 865071082224.
The previous prime is 1081338852761. The next prime is 1081338852823. The reversal of 1081338852785 is 5872588331801.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 534817241344 + 546521611441 = 731312^2 + 739271^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1081338852785 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108133885274 + ... + 108133885283.
It is an arithmetic number, because the mean of its divisors is an integer number (324401655837).
Almost surely, 21081338852785 is an apocalyptic number.
It is an amenable number.
1081338852785 is a deficient number, since it is larger than the sum of its proper divisors (216267770563).
1081338852785 is an equidigital number, since it uses as much as digits as its factorization.
1081338852785 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216267770562.
The product of its (nonzero) digits is 12902400, while the sum is 59.
The spelling of 1081338852785 in words is "one trillion, eighty-one billion, three hundred thirty-eight million, eight hundred fifty-two thousand, seven hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •