Base | Representation |
---|---|
bin | 10100101110110000… |
… | …00001001100111111 |
3 | 1001201122021210002221 |
4 | 22113120001030333 |
5 | 140243133344331 |
6 | 5040213430211 |
7 | 542541646660 |
oct | 122730011477 |
9 | 31648253087 |
10 | 11129590591 |
11 | 47a1400159 |
12 | 21a733b367 |
13 | 1084a2b982 |
14 | 7781a5367 |
15 | 45213b711 |
hex | 29760133f |
11129590591 has 4 divisors (see below), whose sum is σ = 12719532112. Its totient is φ = 9539649072.
The previous prime is 11129590561. The next prime is 11129590597. The reversal of 11129590591 is 19509592111.
It is a happy number.
11129590591 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 19509592111 = 31 ⋅629341681.
It is a cyclic number.
It is not a de Polignac number, because 11129590591 - 229 = 10592719679 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11129590597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 794970750 + ... + 794970763.
It is an arithmetic number, because the mean of its divisors is an integer number (3179883028).
Almost surely, 211129590591 is an apocalyptic number.
11129590591 is a deficient number, since it is larger than the sum of its proper divisors (1589941521).
11129590591 is an equidigital number, since it uses as much as digits as its factorization.
11129590591 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1589941520.
The product of its (nonzero) digits is 36450, while the sum is 43.
The spelling of 11129590591 in words is "eleven billion, one hundred twenty-nine million, five hundred ninety thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •