Base | Representation |
---|---|
bin | 100010111001101… |
… | …1100110000010100 |
3 | 10000121122210210200 |
4 | 1011303130300110 |
5 | 4344301140103 |
6 | 312113020500 |
7 | 41010212346 |
oct | 10563346024 |
9 | 3017583720 |
10 | 1171115028 |
11 | 551078066 |
12 | 288254730 |
13 | 15881cb95 |
14 | b1771296 |
15 | 6cc320a3 |
hex | 45cdcc14 |
1171115028 has 18 divisors (see below), whose sum is σ = 2960318634. Its totient is φ = 390371664.
The previous prime is 1171114999. The next prime is 1171115041. The reversal of 1171115028 is 8205111711.
It can be written as a sum of positive squares in only one way, i.e., 1150430724 + 20684304 = 33918^2 + 4548^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a junction number, because it is equal to n+sod(n) for n = 1171114992 and 1171115010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 16265451 + ... + 16265522.
Almost surely, 21171115028 is an apocalyptic number.
1171115028 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1171115028 is an abundant number, since it is smaller than the sum of its proper divisors (1789203606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1171115028 is a wasteful number, since it uses less digits than its factorization.
1171115028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32530983 (or 32530978 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 27.
The square root of 1171115028 is about 34221.5579423264. The cubic root of 1171115028 is about 1054.0628764908.
Adding to 1171115028 its reverse (8205111711), we get a palindrome (9376226739).
The spelling of 1171115028 in words is "one billion, one hundred seventy-one million, one hundred fifteen thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •