Base | Representation |
---|---|
bin | 110001011011111110… |
… | …1111010000011011101 |
3 | 101011000212110001012121 |
4 | 1202313331322003131 |
5 | 3214411403033310 |
6 | 120434414502541 |
7 | 10445612225023 |
oct | 1426775720335 |
9 | 334025401177 |
10 | 106165674205 |
11 | 4102a834418 |
12 | 186aa804a51 |
13 | a01c004886 |
14 | 51d1c78713 |
15 | 2b6569b0da |
hex | 18b7f7a0dd |
106165674205 has 8 divisors (see below), whose sum is σ = 127833619032. Its totient is φ = 84642666048.
The previous prime is 106165674191. The next prime is 106165674211. The reversal of 106165674205 is 502476561601.
It can be written as a sum of positive squares in 4 ways, for example, as 47916334404 + 58249339801 = 218898^2 + 241349^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106165674205 is a prime.
It is a super-2 number, since 2×1061656742052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 36232554 + ... + 36235483.
It is an arithmetic number, because the mean of its divisors is an integer number (15979202379).
Almost surely, 2106165674205 is an apocalyptic number.
It is an amenable number.
106165674205 is a deficient number, since it is larger than the sum of its proper divisors (21667944827).
106165674205 is an equidigital number, since it uses as much as digits as its factorization.
106165674205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72468335.
The product of its (nonzero) digits is 302400, while the sum is 43.
The spelling of 106165674205 in words is "one hundred six billion, one hundred sixty-five million, six hundred seventy-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •