Base | Representation |
---|---|
bin | 1100100011000… |
… | …01110101100110 |
3 | 21100001200022010 |
4 | 12101201311212 |
5 | 203421231332 |
6 | 14240015050 |
7 | 2415452430 |
oct | 621416546 |
9 | 240050263 |
10 | 105258342 |
11 | 54463172 |
12 | 2b301486 |
13 | 18a65057 |
14 | dd9d650 |
15 | 93929cc |
hex | 6461d66 |
105258342 has 64 divisors (see below), whose sum is σ = 251942400. Its totient is φ = 28680960.
The previous prime is 105258341. The next prime is 105258353. The reversal of 105258342 is 243852501.
It is a super-2 number, since 2×1052583422 = 22158637121177928, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105258341) 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 31 ways as a sum of consecutive naturals, for example, 107917 + ... + 108887.
It is an arithmetic number, because the mean of its divisors is an integer number (3936600).
Almost surely, 2105258342 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105258342, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125971200).
105258342 is an abundant number, since it is smaller than the sum of its proper divisors (146684058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105258342 is a wasteful number, since it uses less digits than its factorization.
105258342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101.
The product of its (nonzero) digits is 9600, while the sum is 30.
The square root of 105258342 is about 10259.5488204891. The cubic root of 105258342 is about 472.1559949527.
The spelling of 105258342 in words is "one hundred five million, two hundred fifty-eight thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •