Base | Representation |
---|---|
bin | 110001101000011111… |
… | …1011101000010111101 |
3 | 101012010010102220202100 |
4 | 1203100333131002331 |
5 | 3221241342310302 |
6 | 120544213215313 |
7 | 10462200613224 |
oct | 1432077350275 |
9 | 335103386670 |
10 | 106585510077 |
11 | 41225818312 |
12 | 187a7331539 |
13 | a087c9c977 |
14 | 5231923cbb |
15 | 2b8c47bd1c |
hex | 18d0fdd0bd |
106585510077 has 12 divisors (see below), whose sum is σ = 154340785404. Its totient is φ = 70879804800.
The previous prime is 106585510069. The next prime is 106585510111. The reversal of 106585510077 is 770015585601.
106585510077 is a `hidden beast` number, since 1 + 0 + 65 + 8 + 5 + 510 + 0 + 77 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 103903720281 + 2681789796 = 322341^2 + 51786^2 .
It is not a de Polignac number, because 106585510077 - 23 = 106585510069 is a prime.
It is a super-2 number, since 2×1065855100772 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106585510777) 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, 14763018 + ... + 14770235.
It is an arithmetic number, because the mean of its divisors is an integer number (12861732117).
Almost surely, 2106585510077 is an apocalyptic number.
It is an amenable number.
106585510077 is a deficient number, since it is larger than the sum of its proper divisors (47755275327).
106585510077 is a wasteful number, since it uses less digits than its factorization.
106585510077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29533660 (or 29533657 counting only the distinct ones).
The product of its (nonzero) digits is 294000, while the sum is 45.
The spelling of 106585510077 in words is "one hundred six billion, five hundred eighty-five million, five hundred ten thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •