Base | Representation |
---|---|
bin | 10101001000000101… |
… | …10110001111110101 |
3 | 1002021110020122020222 |
4 | 22210002312033311 |
5 | 141212042111001 |
6 | 5113245304125 |
7 | 551032431452 |
oct | 124402661765 |
9 | 32243218228 |
10 | 11342144501 |
11 | 48a0388046 |
12 | 2246565045 |
13 | 10b9a9010c |
14 | 7984d4829 |
15 | 465b2561b |
hex | 2a40b63f5 |
11342144501 has 2 divisors, whose sum is σ = 11342144502. Its totient is φ = 11342144500.
The previous prime is 11342144477. The next prime is 11342144521. The reversal of 11342144501 is 10544124311.
11342144501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8617408900 + 2724735601 = 92830^2 + 52199^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11342144501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11342144521) 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 as a sum of consecutive naturals, namely, 5671072250 + 5671072251.
It is an arithmetic number, because the mean of its divisors is an integer number (5671072251).
Almost surely, 211342144501 is an apocalyptic number.
It is an amenable number.
11342144501 is a deficient number, since it is larger than the sum of its proper divisors (1).
11342144501 is an equidigital number, since it uses as much as digits as its factorization.
11342144501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 11342144501 its reverse (10544124311), we get a palindrome (21886268812).
The spelling of 11342144501 in words is "eleven billion, three hundred forty-two million, one hundred forty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •