Base | Representation |
---|---|
bin | 100111111001000100… |
… | …1110101000000011001 |
3 | 22012010021122121012200 |
4 | 1033302021311000121 |
5 | 2400421230310210 |
6 | 103204354000413 |
7 | 6121623556626 |
oct | 1176211650031 |
9 | 265107577180 |
10 | 85667041305 |
11 | 333708a209a |
12 | 14729876109 |
13 | 81032331b1 |
14 | 420967534d |
15 | 2365c870c0 |
hex | 13f2275019 |
85667041305 has 24 divisors (see below), whose sum is σ = 148497046152. Its totient is φ = 45686778624.
The previous prime is 85667041297. The next prime is 85667041321. The reversal of 85667041305 is 50314076658.
85667041305 is a `hidden beast` number, since 8 + 566 + 70 + 4 + 13 + 0 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 12894965136 + 72772076169 = 113556^2 + 269763^2 .
It is not a de Polignac number, because 85667041305 - 23 = 85667041297 is a prime.
It is a super-2 number, since 2×856670413052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1217547 + ... + 1285983.
It is an arithmetic number, because the mean of its divisors is an integer number (6187376923).
Almost surely, 285667041305 is an apocalyptic number.
It is an amenable number.
85667041305 is a deficient number, since it is larger than the sum of its proper divisors (62830004847).
85667041305 is a wasteful number, since it uses less digits than its factorization.
85667041305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96265 (or 96262 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The spelling of 85667041305 in words is "eighty-five billion, six hundred sixty-seven million, forty-one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •