Base | Representation |
---|---|
bin | 11111101000010111001… |
… | …11001100000011011101 |
3 | 10211220021110111001111022 |
4 | 33310023213030003131 |
5 | 120301302304021003 |
6 | 2151140125333525 |
7 | 141343310510300 |
oct | 17641347140335 |
9 | 3756243431438 |
10 | 1086821548253 |
11 | 389a11481161 |
12 | 1567724072a5 |
13 | 7b64375532c |
14 | 3a861168b37 |
15 | 1d40da4e738 |
hex | fd0b9cc0dd |
1086821548253 has 12 divisors (see below), whose sum is σ = 1338630143292. Its totient is φ = 876763601280.
The previous prime is 1086821548249. The next prime is 1086821548301. The reversal of 1086821548253 is 3528451286801.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 787013831044 + 299807717209 = 887138^2 + 547547^2 .
It is not a de Polignac number, because 1086821548253 - 22 = 1086821548249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1086821548195 and 1086821548204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1086821548453) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 652353038 + ... + 652354703.
It is an arithmetic number, because the mean of its divisors is an integer number (111552511941).
Almost surely, 21086821548253 is an apocalyptic number.
It is an amenable number.
1086821548253 is a deficient number, since it is larger than the sum of its proper divisors (251808595039).
1086821548253 is a wasteful number, since it uses less digits than its factorization.
1086821548253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1304707772 (or 1304707765 counting only the distinct ones).
The product of its (nonzero) digits is 3686400, while the sum is 53.
The spelling of 1086821548253 in words is "one trillion, eighty-six billion, eight hundred twenty-one million, five hundred forty-eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •