Base | Representation |
---|---|
bin | 100001000111001… |
… | …0100111100010100 |
3 | 2212102122021220000 |
4 | 1002032110330110 |
5 | 4233412131202 |
6 | 302125411300 |
7 | 36350533545 |
oct | 10216247424 |
9 | 2772567800 |
10 | 1111052052 |
11 | 520183940 |
12 | 270109b30 |
13 | 149250366 |
14 | a77b84cc |
15 | 6781a91c |
hex | 42394f14 |
1111052052 has 60 divisors (see below), whose sum is σ = 3168566016. Its totient is φ = 336681360.
The previous prime is 1111052023. The next prime is 1111052081. The reversal of 1111052052 is 2502501111.
It is an interprime number because it is at equal distance from previous prime (1111052023) and next prime (1111052081).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 152308 + ... + 159435.
Almost surely, 21111052052 is an apocalyptic number.
1111052052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1111052052 is an abundant number, since it is smaller than the sum of its proper divisors (2057513964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111052052 is a wasteful number, since it uses less digits than its factorization.
1111052052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311770 (or 311759 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
The square root of 1111052052 is about 33332.4474348944. The cubic root of 1111052052 is about 1035.7258172872.
Adding to 1111052052 its reverse (2502501111), we get a palindrome (3613553163).
The spelling of 1111052052 in words is "one billion, one hundred eleven million, fifty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •