Base | Representation |
---|---|
bin | 10100100101110010… |
… | …10001110001100111 |
3 | 1001112101211212202101 |
4 | 22102321101301213 |
5 | 140114413020033 |
6 | 5024530352531 |
7 | 540640021621 |
oct | 122271216147 |
9 | 31471755671 |
10 | 11054423143 |
11 | 4762a2a7a5 |
12 | 218612b747 |
13 | 10722a10aa |
14 | 76c1d9c11 |
15 | 44a73e97d |
hex | 292e51c67 |
11054423143 has 4 divisors (see below), whose sum is σ = 11187609048. Its totient is φ = 10921237240.
The previous prime is 11054423071. The next prime is 11054423173. The reversal of 11054423143 is 34132445011.
11054423143 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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11054423143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11054423173) 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, 66592828 + ... + 66592993.
It is an arithmetic number, because the mean of its divisors is an integer number (2796902262).
Almost surely, 211054423143 is an apocalyptic number.
11054423143 is a deficient number, since it is larger than the sum of its proper divisors (133185905).
11054423143 is an equidigital number, since it uses as much as digits as its factorization.
11054423143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133185904.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 11054423143 its reverse (34132445011), we get a palindrome (45186868154).
The spelling of 11054423143 in words is "eleven billion, fifty-four million, four hundred twenty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •