Base | Representation |
---|---|
bin | 1100101101001… |
… | …11110011000010 |
3 | 21102120111202110 |
4 | 12112213303002 |
5 | 204241442344 |
6 | 14324400150 |
7 | 2433013101 |
oct | 626476302 |
9 | 242514673 |
10 | 106593474 |
11 | 55195289 |
12 | 2b846056 |
13 | 19111980 |
14 | 1022a038 |
15 | 95583b9 |
hex | 65a7cc2 |
106593474 has 64 divisors (see below), whose sum is σ = 239234688. Its totient is φ = 31449600.
The previous prime is 106593463. The next prime is 106593479. The reversal of 106593474 is 474395601.
It is a super-3 number, since 3×1065934743 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106593479) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 204334 + ... + 204854.
It is an arithmetic number, because the mean of its divisors is an integer number (3738042).
Almost surely, 2106593474 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106593474, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119617344).
106593474 is an abundant number, since it is smaller than the sum of its proper divisors (132641214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106593474 is a wasteful number, since it uses less digits than its factorization.
106593474 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 643.
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 106593474 is about 10324.4115570816. The cubic root of 106593474 is about 474.1439414007.
The spelling of 106593474 in words is "one hundred six million, five hundred ninety-three thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •