Base | Representation |
---|---|
bin | 1101010000100… |
… | …11000001111100 |
3 | 21202021220202200 |
4 | 12220103001330 |
5 | 211433231004 |
6 | 15011551500 |
7 | 2520261660 |
oct | 650230174 |
9 | 252256680 |
10 | 111227004 |
11 | 5786a549 |
12 | 312bb590 |
13 | 1a0749c5 |
14 | 10ab48a0 |
15 | 9b71239 |
hex | 6a1307c |
111227004 has 72 divisors (see below), whose sum is σ = 328194048. Its totient is φ = 31099680.
The previous prime is 111227003. The next prime is 111227027. The reversal of 111227004 is 400722111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111227003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7149 + ... + 16539.
Almost surely, 2111227004 is an apocalyptic number.
111227004 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111227004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164097024).
111227004 is an abundant number, since it is smaller than the sum of its proper divisors (216967044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111227004 is a wasteful number, since it uses less digits than its factorization.
111227004 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9455 (or 9450 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 18.
The square root of 111227004 is about 10546.4213835784. The cubic root of 111227004 is about 480.9169451587.
Adding to 111227004 its reverse (400722111), we get a palindrome (511949115).
The spelling of 111227004 in words is "one hundred eleven million, two hundred twenty-seven thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •