Base | Representation |
---|---|
bin | 1100101011111… |
… | …00110001010101 |
3 | 21102020120000011 |
4 | 12111330301111 |
5 | 204220322422 |
6 | 14320520221 |
7 | 2431350223 |
oct | 625746125 |
9 | 242216004 |
10 | 106417237 |
11 | 55084933 |
12 | 2b780071 |
13 | 1907c6a4 |
14 | 101c1b13 |
15 | 9521077 |
hex | 657cc55 |
106417237 has 4 divisors (see below), whose sum is σ = 107255296. Its totient is φ = 105579180.
The previous prime is 106417219. The next prime is 106417249. The reversal of 106417237 is 732714601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106417237 is a prime.
It is a super-2 number, since 2×1064172372 = 22649256661428338, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106417199 and 106417208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106417937) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 418839 + ... + 419092.
It is an arithmetic number, because the mean of its divisors is an integer number (26813824).
Almost surely, 2106417237 is an apocalyptic number.
It is an amenable number.
106417237 is a deficient number, since it is larger than the sum of its proper divisors (838059).
106417237 is an equidigital number, since it uses as much as digits as its factorization.
106417237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838058.
The product of its (nonzero) digits is 7056, while the sum is 31.
The square root of 106417237 is about 10315.8730604831. The cubic root of 106417237 is about 473.8824876192.
The spelling of 106417237 in words is "one hundred six million, four hundred seventeen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •