Base | Representation |
---|---|
bin | 110001100110001000… |
… | …0110001110101110111 |
3 | 101011220121010210121212 |
4 | 1203030100301311313 |
5 | 3221111034244443 |
6 | 120532300432035 |
7 | 10460215320254 |
oct | 1431420616567 |
9 | 334817123555 |
10 | 106506165623 |
11 | 41194a54690 |
12 | 1878484861b |
13 | a07470baa0 |
14 | 522518c42b |
15 | 2b85507618 |
hex | 18cc431d77 |
106506165623 has 8 divisors (see below), whose sum is σ = 125126124816. Its totient is φ = 89375803200.
The previous prime is 106506165613. The next prime is 106506165671. The reversal of 106506165623 is 326561605601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106506165623 - 212 = 106506161527 is a prime.
It is a super-2 number, since 2×1065061656232 (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 (106506165613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 372399038 + ... + 372399323.
It is an arithmetic number, because the mean of its divisors is an integer number (15640765602).
Almost surely, 2106506165623 is an apocalyptic number.
106506165623 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
106506165623 is a deficient number, since it is larger than the sum of its proper divisors (18619959193).
106506165623 is a wasteful number, since it uses less digits than its factorization.
106506165623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744798385.
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 106506165623 in words is "one hundred six billion, five hundred six million, one hundred sixty-five thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •