Base | Representation |
---|---|
bin | 1100101110011… |
… | …01001010001001 |
3 | 21102212021200021 |
4 | 12113031022021 |
5 | 204311342010 |
6 | 14331540441 |
7 | 2434221205 |
oct | 627151211 |
9 | 242767607 |
10 | 106746505 |
11 | 5528a258 |
12 | 2b8ba721 |
13 | 19166518 |
14 | 10269b05 |
15 | 95888da |
hex | 65cd289 |
106746505 has 8 divisors (see below), whose sum is σ = 130513032. Its totient is φ = 83785728.
The previous prime is 106746499. The next prime is 106746509. The reversal of 106746505 is 505647601.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 24681024 + 82065481 = 4968^2 + 9059^2 .
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 106746505 - 217 = 106615433 is a prime.
It is a super-2 number, since 2×1067465052 = 22789632659430050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106746509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201144 + ... + 201673.
It is an arithmetic number, because the mean of its divisors is an integer number (16314129).
Almost surely, 2106746505 is an apocalyptic number.
It is an amenable number.
106746505 is a deficient number, since it is larger than the sum of its proper divisors (23766527).
106746505 is an equidigital number, since it uses as much as digits as its factorization.
106746505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402875.
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 106746505 is about 10331.8200235970. The cubic root of 106746505 is about 474.3707346037.
The spelling of 106746505 in words is "one hundred six million, seven hundred forty-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •