Base | Representation |
---|---|
bin | 1100100010000… |
… | …01001001000110 |
3 | 21022210212121010 |
4 | 12101001021012 |
5 | 203402440142 |
6 | 14233103050 |
7 | 2414354124 |
oct | 621011106 |
9 | 238725533 |
10 | 105124422 |
11 | 54381597 |
12 | 2b257a86 |
13 | 18a19100 |
14 | dd66914 |
15 | 9367e9c |
hex | 6441246 |
105124422 has 48 divisors (see below), whose sum is σ = 233057088. Its totient is φ = 31580640.
The previous prime is 105124403. The next prime is 105124427. The reversal of 105124422 is 224421501.
It is a super-2 number, since 2×1051244222 = 22102288201668168, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105124427) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42397 + ... + 44807.
It is an arithmetic number, because the mean of its divisors is an integer number (4855356).
Almost surely, 2105124422 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105124422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116528544).
105124422 is an abundant number, since it is smaller than the sum of its proper divisors (127932666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105124422 is a wasteful number, since it uses less digits than its factorization.
105124422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2485 (or 2472 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 21.
The square root of 105124422 is about 10253.0201404269. The cubic root of 105124422 is about 471.9556688950.
Adding to 105124422 its reverse (224421501), we get a palindrome (329545923).
The spelling of 105124422 in words is "one hundred five million, one hundred twenty-four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •