Base | Representation |
---|---|
bin | 1101110110100… |
… | …01111000101010 |
3 | 22002122201121200 |
4 | 12323101320222 |
5 | 214221444200 |
6 | 15310345030 |
7 | 2610465255 |
oct | 673217052 |
9 | 262581550 |
10 | 116203050 |
11 | 5a659087 |
12 | 32abb176 |
13 | 1b0c7902 |
14 | 1160c09c |
15 | a305800 |
hex | 6ed1e2a |
116203050 has 72 divisors (see below), whose sum is σ = 328654560. Its totient is φ = 29354400.
The previous prime is 116203033. The next prime is 116203057. The reversal of 116203050 is 50302611.
116203050 is a `hidden beast` number, since 11 + 620 + 30 + 5 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (116203057) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1755 + ... + 15345.
Almost surely, 2116203050 is an apocalyptic number.
116203050 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 116203050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164327280).
116203050 is an abundant number, since it is smaller than the sum of its proper divisors (212451510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116203050 is a wasteful number, since it uses less digits than its factorization.
116203050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13628 (or 13620 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 116203050 is about 10779.7518524315. The cubic root of 116203050 is about 487.9842919113.
Adding to 116203050 its reverse (50302611), we get a palindrome (166505661).
The spelling of 116203050 in words is "one hundred sixteen million, two hundred three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •