Base | Representation |
---|---|
bin | 100001000111110… |
… | …1111000001111100 |
3 | 2212110100001001200 |
4 | 1002033233001330 |
5 | 4234010433202 |
6 | 302141335500 |
7 | 36353631420 |
oct | 10217570174 |
9 | 2773301050 |
10 | 1111421052 |
11 | 5204060a5 |
12 | 270267590 |
13 | 14934c2c1 |
14 | a7872b80 |
15 | 6788ee1c |
hex | 423ef07c |
1111421052 has 72 divisors (see below), whose sum is σ = 3314368512. Its totient is φ = 307303200.
The previous prime is 1111421041. The next prime is 1111421063. The reversal of 1111421052 is 2501241111.
It is an interprime number because it is at equal distance from previous prime (1111421041) and next prime (1111421063).
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 polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63324 + ... + 78947.
It is an arithmetic number, because the mean of its divisors is an integer number (46032896).
Almost surely, 21111421052 is an apocalyptic number.
1111421052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1111421052 is an abundant number, since it is smaller than the sum of its proper divisors (2202947460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111421052 is a wasteful number, since it uses less digits than its factorization.
1111421052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142319 (or 142314 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
The square root of 1111421052 is about 33337.9821224981. The cubic root of 1111421052 is about 1035.8404655384.
Adding to 1111421052 its reverse (2501241111), we get a palindrome (3612662163).
The spelling of 1111421052 in words is "one billion, one hundred eleven million, four hundred twenty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •