Base | Representation |
---|---|
bin | 110001010111010000… |
… | …0101100101111111001 |
3 | 101010121210220201002200 |
4 | 1202232200230233321 |
5 | 3214100244210320 |
6 | 120410550220413 |
7 | 10441644552612 |
oct | 1425640545771 |
9 | 333553821080 |
10 | 106007022585 |
11 | 40a59223082 |
12 | 18665654709 |
13 | 9cc5196a89 |
14 | 51b8b7ac09 |
15 | 2b567ad290 |
hex | 18ae82cbf9 |
106007022585 has 48 divisors (see below), whose sum is σ = 188152536000. Its totient is φ = 55182943872.
The previous prime is 106007022571. The next prime is 106007022599. The reversal of 106007022585 is 585220700601.
It is a happy number.
106007022585 is a `hidden beast` number, since 1 + 0 + 6 + 0 + 0 + 70 + 2 + 2 + 585 = 666.
It is an interprime number because it is at equal distance from previous prime (106007022571) and next prime (106007022599).
It is not a de Polignac number, because 106007022585 - 224 = 105990245369 is a prime.
It is a super-2 number, since 2×1060070225852 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2804391 + ... + 2841939.
It is an arithmetic number, because the mean of its divisors is an integer number (3919844500).
Almost surely, 2106007022585 is an apocalyptic number.
106007022585 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106007022585 is a deficient number, since it is larger than the sum of its proper divisors (82145513415).
106007022585 is a wasteful number, since it uses less digits than its factorization.
106007022585 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39062 (or 39059 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The spelling of 106007022585 in words is "one hundred six billion, seven million, twenty-two thousand, five hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •