Base | Representation |
---|---|
bin | 1100100111111… |
… | …11010000010110 |
3 | 21101021102210000 |
4 | 12103333100112 |
5 | 204102400001 |
6 | 14301512130 |
7 | 2424106320 |
oct | 623772026 |
9 | 241242700 |
10 | 105903126 |
11 | 5486364a |
12 | 2b572646 |
13 | 18c2c694 |
14 | 100ca610 |
15 | 946da86 |
hex | 64ff416 |
105903126 has 80 divisors (see below), whose sum is σ = 277111296. Its totient is φ = 29599344.
The previous prime is 105903121. The next prime is 105903163. The reversal of 105903126 is 621309501.
It is a super-2 number, since 2×1059031262 = 22430944193143752, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 105903126.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105903121) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 52305 + ... + 54291.
Almost surely, 2105903126 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105903126, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138555648).
105903126 is an abundant number, since it is smaller than the sum of its proper divisors (171208170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105903126 is a wasteful number, since it uses less digits than its factorization.
105903126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2055 (or 2046 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 105903126 is about 10290.9244482699. The cubic root of 105903126 is about 473.1181327941.
The spelling of 105903126 in words is "one hundred five million, nine hundred three thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •