Base | Representation |
---|---|
bin | 1100101100110… |
… | …01111101011101 |
3 | 21102110122000022 |
4 | 12112121331131 |
5 | 204233134142 |
6 | 14323241525 |
7 | 2432355623 |
oct | 626317535 |
9 | 242418008 |
10 | 106536797 |
11 | 55156744 |
12 | 2b8192a5 |
13 | 190c1c33 |
14 | 10213513 |
15 | 95466d2 |
hex | 6599f5d |
106536797 has 8 divisors (see below), whose sum is σ = 107865216. Its totient is φ = 105214752.
The previous prime is 106536751. The next prime is 106536799. The reversal of 106536797 is 797635601.
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 106536797 - 210 = 106535773 is a prime.
It is a super-3 number, since 3×1065367973 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106536799) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37913 + ... + 40625.
It is an arithmetic number, because the mean of its divisors is an integer number (13483152).
Almost surely, 2106536797 is an apocalyptic number.
It is an amenable number.
106536797 is a deficient number, since it is larger than the sum of its proper divisors (1328419).
106536797 is a wasteful number, since it uses less digits than its factorization.
106536797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3187.
The product of its (nonzero) digits is 238140, while the sum is 44.
The square root of 106536797 is about 10321.6663867808. Note that the first 3 decimals coincide. The cubic root of 106536797 is about 474.0598905376.
The spelling of 106536797 in words is "one hundred six million, five hundred thirty-six thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •