Base | Representation |
---|---|
bin | 100000011100001… |
… | …1100000100010101 |
3 | 2210212021101211202 |
4 | 1000320130010111 |
5 | 4212131134403 |
6 | 300003042245 |
7 | 35655260555 |
oct | 10070340425 |
9 | 2725241752 |
10 | 1088536853 |
11 | 5094a5938 |
12 | 264670385 |
13 | 144699161 |
14 | a47d7165 |
15 | 6586e688 |
hex | 40e1c115 |
1088536853 has 2 divisors, whose sum is σ = 1088536854. Its totient is φ = 1088536852.
The previous prime is 1088536849. The next prime is 1088536901. The reversal of 1088536853 is 3586358801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 894129604 + 194407249 = 29902^2 + 13943^2 .
It is an emirp because it is prime and its reverse (3586358801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1088536853 - 22 = 1088536849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1088536798 and 1088536807.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1088536153) by changing a digit.
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 as a sum of consecutive naturals, namely, 544268426 + 544268427.
It is an arithmetic number, because the mean of its divisors is an integer number (544268427).
Almost surely, 21088536853 is an apocalyptic number.
It is an amenable number.
1088536853 is a deficient number, since it is larger than the sum of its proper divisors (1).
1088536853 is an equidigital number, since it uses as much as digits as its factorization.
1088536853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 691200, while the sum is 47.
The square root of 1088536853 is about 32992.9818749382. The cubic root of 1088536853 is about 1028.6817751424.
The spelling of 1088536853 in words is "one billion, eighty-eight million, five hundred thirty-six thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •