Base | Representation |
---|---|
bin | 1100101010100… |
… | …00000011000010 |
3 | 21101220020201110 |
4 | 12111100003002 |
5 | 204143442200 |
6 | 14312544150 |
7 | 2426655156 |
oct | 625200302 |
9 | 241806643 |
10 | 106234050 |
11 | 54a6a23a |
12 | 2b6b2056 |
13 | 190171b0 |
14 | 10175066 |
15 | 94d6b50 |
hex | 65500c2 |
106234050 has 96 divisors (see below), whose sum is σ = 286356672. Its totient is φ = 25908480.
The previous prime is 106234039. The next prime is 106234081. The reversal of 106234050 is 50432601.
It is a happy number.
It is a super-2 number, since 2×1062340502 = 22571346758805000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 305977 + ... + 306323.
It is an arithmetic number, because the mean of its divisors is an integer number (2982882).
Almost surely, 2106234050 is an apocalyptic number.
106234050 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 106234050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143178336).
106234050 is an abundant number, since it is smaller than the sum of its proper divisors (180122622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106234050 is a wasteful number, since it uses less digits than its factorization.
106234050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532 (or 527 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 106234050 is about 10306.9903463620. The cubic root of 106234050 is about 473.6104171271.
Adding to 106234050 its reverse (50432601), we get a palindrome (156666651).
The spelling of 106234050 in words is "one hundred six million, two hundred thirty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •