Base | Representation |
---|---|
bin | 101010100010… |
… | …001001111110 |
3 | 202222110212010 |
4 | 222202021332 |
5 | 10323244300 |
6 | 1034552050 |
7 | 163526100 |
oct | 52421176 |
9 | 22873763 |
10 | 11149950 |
11 | 6326139 |
12 | 3898626 |
13 | 2405106 |
14 | 16a3570 |
15 | ea3a50 |
hex | aa227e |
11149950 has 144 divisors (see below), whose sum is σ = 33841584. Its totient is φ = 2419200.
The previous prime is 11149927. The next prime is 11149961. The reversal of 11149950 is 5994111.
11149950 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 271930 + ... + 271970.
It is an arithmetic number, because the mean of its divisors is an integer number (235011).
Almost surely, 211149950 is an apocalyptic number.
11149950 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 11149950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16920792).
11149950 is an abundant number, since it is smaller than the sum of its proper divisors (22691634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11149950 is a wasteful number, since it uses less digits than its factorization.
11149950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107 (or 95 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 30.
The square root of 11149950 is about 3339.1540844951. The cubic root of 11149950 is about 223.4040146570.
The spelling of 11149950 in words is "eleven million, one hundred forty-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •