Base | Representation |
---|---|
bin | 110011010110011… |
… | …000101000101101 |
3 | 2020001002001012002 |
4 | 303112120220231 |
5 | 3231021143333 |
6 | 221253022045 |
7 | 30230452400 |
oct | 6326305055 |
9 | 2201061162 |
10 | 861506093 |
11 | 402330308 |
12 | 200624925 |
13 | 109639526 |
14 | 825b9d37 |
15 | 509760e8 |
hex | 33598a2d |
861506093 has 12 divisors (see below), whose sum is σ = 1061111772. Its totient is φ = 694995840.
The previous prime is 861506071. The next prime is 861506117. The reversal of 861506093 is 390605168.
861506093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 758341444 + 103164649 = 27538^2 + 10157^2 .
It is not a de Polignac number, because 861506093 - 210 = 861505069 is a prime.
It is a super-2 number, since 2×8615060932 = 1484385496552249298, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (861500093) 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, 516278 + ... + 517943.
It is an arithmetic number, because the mean of its divisors is an integer number (88425981).
Almost surely, 2861506093 is an apocalyptic number.
It is an amenable number.
861506093 is a deficient number, since it is larger than the sum of its proper divisors (199605679).
861506093 is a wasteful number, since it uses less digits than its factorization.
861506093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034252 (or 1034245 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 38.
The square root of 861506093 is about 29351.4240370037. The cubic root of 861506093 is about 951.5233520777.
The spelling of 861506093 in words is "eight hundred sixty-one million, five hundred six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •