Base | Representation |
---|---|
bin | 100000010111000… |
… | …0011100000111101 |
3 | 2210200011002221122 |
4 | 1000232003200331 |
5 | 4210432033340 |
6 | 255424440325 |
7 | 35623162643 |
oct | 10056034075 |
9 | 2720132848 |
10 | 1085814845 |
11 | 507a06845 |
12 | 2637790a5 |
13 | 143c551bb |
14 | a42c9193 |
15 | 654d2db5 |
hex | 40b8383d |
1085814845 has 8 divisors (see below), whose sum is σ = 1304350776. Its totient is φ = 867736576.
The previous prime is 1085814833. The next prime is 1085814893. The reversal of 1085814845 is 5484185801.
It can be written as a sum of positive squares in 4 ways, for example, as 10106041 + 1075708804 = 3179^2 + 32798^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1085814845 - 218 = 1085552701 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1085814796 and 1085814805.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 109172 + ... + 118701.
It is an arithmetic number, because the mean of its divisors is an integer number (163043847).
Almost surely, 21085814845 is an apocalyptic number.
It is an amenable number.
1085814845 is a deficient number, since it is larger than the sum of its proper divisors (218535931).
1085814845 is an equidigital number, since it uses as much as digits as its factorization.
1085814845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228831.
The product of its (nonzero) digits is 204800, while the sum is 44.
The square root of 1085814845 is about 32951.7047358706. The cubic root of 1085814845 is about 1027.8236148721.
The spelling of 1085814845 in words is "one billion, eighty-five million, eight hundred fourteen thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •