Base | Representation |
---|---|
bin | 10000010011100110001… |
… | …100010100010101101111 |
3 | 10222010100022002000121002 |
4 | 100103212030110111233 |
5 | 121324343143020204 |
6 | 2214435234030515 |
7 | 143646234321215 |
oct | 20234614242557 |
9 | 3863308060532 |
10 | 1120553485679 |
11 | 3a2251258aa1 |
12 | 16120711843b |
13 | 8188b043b14 |
14 | 3c3410a8cb5 |
15 | 1e2350ec91e |
hex | 104e631456f |
1120553485679 has 2 divisors, whose sum is σ = 1120553485680. Its totient is φ = 1120553485678.
The previous prime is 1120553485631. The next prime is 1120553485739. The reversal of 1120553485679 is 9765843550211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1120553485679 - 232 = 1116258518383 is a prime.
It is a super-2 number, since 2×11205534856792 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120553485609) 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 as a sum of consecutive naturals, namely, 560276742839 + 560276742840.
It is an arithmetic number, because the mean of its divisors is an integer number (560276742840).
It is a 2-persistent number, because it is pandigital, and so is 2⋅1120553485679 = 2241106971358, but 3⋅1120553485679 = 3361660457037 is not.
Almost surely, 21120553485679 is an apocalyptic number.
1120553485679 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120553485679 is an equidigital number, since it uses as much as digits as its factorization.
1120553485679 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072000, while the sum is 56.
The spelling of 1120553485679 in words is "one trillion, one hundred twenty billion, five hundred fifty-three million, four hundred eighty-five thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •