Base | Representation |
---|---|
bin | 100100110001001000110… |
… | …0001100110000100100111 |
3 | 122220002111202211101012211 |
4 | 1021202101201212010213 |
5 | 1130243201144334421 |
6 | 14425244202224251 |
7 | 1031043025102210 |
oct | 111422141460447 |
9 | 18802452741184 |
10 | 5053323043111 |
11 | 1679114133032 |
12 | 69744b7b5087 |
13 | 2a86ac423895 |
14 | 136821570407 |
15 | 8b6adbbb9e1 |
hex | 49891866127 |
5053323043111 has 4 divisors (see below), whose sum is σ = 5775226334992. Its totient is φ = 4331419751232.
The previous prime is 5053323043073. The next prime is 5053323043123. The reversal of 5053323043111 is 1113403233505.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5053323043111 - 227 = 5053188825383 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 (5053323043211) 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, 360951645930 + ... + 360951645943.
It is an arithmetic number, because the mean of its divisors is an integer number (1443806583748).
Almost surely, 25053323043111 is an apocalyptic number.
5053323043111 is a deficient number, since it is larger than the sum of its proper divisors (721903291881).
5053323043111 is an equidigital number, since it uses as much as digits as its factorization.
5053323043111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 721903291880.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 5053323043111 its reverse (1113403233505), we get a palindrome (6166726276616).
The spelling of 5053323043111 in words is "five trillion, fifty-three billion, three hundred twenty-three million, forty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •