Base | Representation |
---|---|
bin | 1100101001101… |
… | …01101011100010 |
3 | 21101200202120110 |
4 | 12110311223202 |
5 | 204132013200 |
6 | 14310352150 |
7 | 2426025252 |
oct | 624655342 |
9 | 241622513 |
10 | 106126050 |
11 | 549a6088 |
12 | 2b65b656 |
13 | 18ca9ca4 |
14 | 10147962 |
15 | 94b4b50 |
hex | 6535ae2 |
106126050 has 48 divisors (see below), whose sum is σ = 265786560. Its totient is φ = 28021440.
The previous prime is 106126049. The next prime is 106126061. The reversal of 106126050 is 50621601.
It is a happy number.
It is a super-2 number, since 2×1061260502 = 22525476977205000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12016 + ... + 18884.
It is an arithmetic number, because the mean of its divisors is an integer number (5537220).
Almost surely, 2106126050 is an apocalyptic number.
106126050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 106126050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132893280).
106126050 is an abundant number, since it is smaller than the sum of its proper divisors (159660510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106126050 is a wasteful number, since it uses less digits than its factorization.
106126050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6987 (or 6982 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 106126050 is about 10301.7498513602. The cubic root of 106126050 is about 473.4498682628.
Adding to 106126050 its reverse (50621601), we get a palindrome (156747651).
The spelling of 106126050 in words is "one hundred six million, one hundred twenty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •