Base | Representation |
---|---|
bin | 100010100110100… |
… | …0001111001100001 |
3 | 2222220201010100002 |
4 | 1011031001321201 |
5 | 4334211343203 |
6 | 311113105345 |
7 | 40525464425 |
oct | 10515017141 |
9 | 2886633302 |
10 | 1161043553 |
11 | 54641922a |
12 | 2849b8255 |
13 | 156704927 |
14 | b02acb85 |
15 | 6bde2d88 |
hex | 45341e61 |
1161043553 has 4 divisors (see below), whose sum is σ = 1163814960. Its totient is φ = 1158272148.
The previous prime is 1161043531. The next prime is 1161043567. The reversal of 1161043553 is 3553401611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3553401611 = 151 ⋅23532461.
It is a cyclic number.
It is not a de Polignac number, because 1161043553 - 26 = 1161043489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1161043573) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1385075 + ... + 1385912.
It is an arithmetic number, because the mean of its divisors is an integer number (290953740).
Almost surely, 21161043553 is an apocalyptic number.
It is an amenable number.
1161043553 is a deficient number, since it is larger than the sum of its proper divisors (2771407).
1161043553 is an equidigital number, since it uses as much as digits as its factorization.
1161043553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2771406.
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 1161043553 is about 34074.0891734467. The cubic root of 1161043553 is about 1051.0325603716.
The spelling of 1161043553 in words is "one billion, one hundred sixty-one million, forty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •