Base | Representation |
---|---|
bin | 10000011011010011010… |
… | …101101100100000101011 |
3 | 10222220200220100202111211 |
4 | 100123103111230200223 |
5 | 121443314220031332 |
6 | 2222324230333551 |
7 | 144361250063206 |
oct | 20332325544053 |
9 | 3886626322454 |
10 | 1128827111467 |
11 | 3a5807526560 |
12 | 162935aba2b7 |
13 | 825a917c193 |
14 | 3c8c7c3c93d |
15 | 1e56b647447 |
hex | 106d356c82b |
1128827111467 has 16 divisors (see below), whose sum is σ = 1288568424960. Its totient is φ = 978854483200.
The previous prime is 1128827111431. The next prime is 1128827111483. The reversal of 1128827111467 is 7641117288211.
It is a happy number.
It is not a de Polignac number, because 1128827111467 - 211 = 1128827109419 is a prime.
It is a super-3 number, since 3×11288271114673 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1128827111467.
It is not an unprimeable number, because it can be changed into a prime (1128827111417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6123334 + ... + 6304987.
It is an arithmetic number, because the mean of its divisors is an integer number (80535526560).
Almost surely, 21128827111467 is an apocalyptic number.
1128827111467 is a deficient number, since it is larger than the sum of its proper divisors (159741313493).
1128827111467 is a wasteful number, since it uses less digits than its factorization.
1128827111467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12428714.
The product of its digits is 301056, while the sum is 49.
The spelling of 1128827111467 in words is "one trillion, one hundred twenty-eight billion, eight hundred twenty-seven million, one hundred eleven thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •