Base | Representation |
---|---|
bin | 1101010010001… |
… | …11000010110100 |
3 | 21202200202000100 |
4 | 12221013002310 |
5 | 212012040202 |
6 | 15020314100 |
7 | 2522140053 |
oct | 651070264 |
9 | 252622010 |
10 | 111440052 |
11 | 579a5619 |
12 | 313a2930 |
13 | 1a11a979 |
14 | 10b2c39a |
15 | 9bb441c |
hex | 6a470b4 |
111440052 has 18 divisors (see below), whose sum is σ = 281695778. Its totient is φ = 37146672.
The previous prime is 111440039. The next prime is 111440057. The reversal of 111440052 is 250044111.
It can be written as a sum of positive squares in only one way, i.e., 92044836 + 19395216 = 9594^2 + 4404^2 .
It is a tau number, because it is divible by the number of its divisors (18).
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 (111440057) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1547743 + ... + 1547814.
Almost surely, 2111440052 is an apocalyptic number.
111440052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111440052 is an abundant number, since it is smaller than the sum of its proper divisors (170255726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111440052 is a wasteful number, since it uses less digits than its factorization.
111440052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3095567 (or 3095562 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 111440052 is about 10556.5170392512. The cubic root of 111440052 is about 481.2238042299.
Adding to 111440052 its reverse (250044111), we get a palindrome (361484163).
The spelling of 111440052 in words is "one hundred eleven million, four hundred forty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •