Base | Representation |
---|---|
bin | 110001011001100100… |
… | …0101010111111111111 |
3 | 101010211012220120002101 |
4 | 1202303020222333333 |
5 | 3214230130010142 |
6 | 120422401205531 |
7 | 10443606210253 |
oct | 1426310527777 |
9 | 333735816071 |
10 | 106084610047 |
11 | 40a98aa6749 |
12 | 186876308a7 |
13 | a008291010 |
14 | 51c51b6263 |
15 | 2b5d4d70b7 |
hex | 18b322afff |
106084610047 has 4 divisors (see below), whose sum is σ = 114244964680. Its totient is φ = 97924255416.
The previous prime is 106084610017. The next prime is 106084610057. The reversal of 106084610047 is 740016480601.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-106084610047 is a prime.
It is a super-2 number, since 2×1060846100472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106084609988 and 106084610015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106084610017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4080177297 + ... + 4080177322.
It is an arithmetic number, because the mean of its divisors is an integer number (28561241170).
Almost surely, 2106084610047 is an apocalyptic number.
106084610047 is a deficient number, since it is larger than the sum of its proper divisors (8160354633).
106084610047 is an equidigital number, since it uses as much as digits as its factorization.
106084610047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8160354632.
The product of its (nonzero) digits is 32256, while the sum is 37.
The spelling of 106084610047 in words is "one hundred six billion, eighty-four million, six hundred ten thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •