Base | Representation |
---|---|
bin | 100000010110100… |
… | …1110110010000101 |
3 | 2210122202010122221 |
4 | 1000231032302011 |
5 | 4210403130403 |
6 | 255420052341 |
7 | 35621303143 |
oct | 10055166205 |
9 | 2718663587 |
10 | 1085598853 |
11 | 507879539 |
12 | 2636940b1 |
13 | 143baaab1 |
14 | a4270593 |
15 | 6548ddbd |
hex | 40b4ec85 |
1085598853 has 2 divisors, whose sum is σ = 1085598854. Its totient is φ = 1085598852.
The previous prime is 1085598851. The next prime is 1085598863. The reversal of 1085598853 is 3588955801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1085241249 + 357604 = 32943^2 + 598^2 .
It is a cyclic number.
It is not a de Polignac number, because 1085598853 - 21 = 1085598851 is a prime.
Together with 1085598851, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1085598853.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1085598851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 542799426 + 542799427.
It is an arithmetic number, because the mean of its divisors is an integer number (542799427).
Almost surely, 21085598853 is an apocalyptic number.
It is an amenable number.
1085598853 is a deficient number, since it is larger than the sum of its proper divisors (1).
1085598853 is an equidigital number, since it uses as much as digits as its factorization.
1085598853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728000, while the sum is 52.
The square root of 1085598853 is about 32948.4271703522. The cubic root of 1085598853 is about 1027.7554582549.
The spelling of 1085598853 in words is "one billion, eighty-five million, five hundred ninety-eight thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •