Base | Representation |
---|---|
bin | 10101011111101100… |
… | …00101001011000001 |
3 | 1002210020210001120002 |
4 | 22233312011023001 |
5 | 142113232434403 |
6 | 5145040525345 |
7 | 555655303262 |
oct | 125766051301 |
9 | 32706701502 |
10 | 11540124353 |
11 | 499211025a |
12 | 22a0920855 |
13 | 111babaa64 |
14 | 7b690c969 |
15 | 4781d1188 |
hex | 2afd852c1 |
11540124353 has 2 divisors, whose sum is σ = 11540124354. Its totient is φ = 11540124352.
The previous prime is 11540124313. The next prime is 11540124377. The reversal of 11540124353 is 35342104511.
11540124353 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., 10234964224 + 1305160129 = 101168^2 + 36127^2 .
It is a cyclic number.
It is not a de Polignac number, because 11540124353 - 220 = 11539075777 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11540124313) 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, 5770062176 + 5770062177.
It is an arithmetic number, because the mean of its divisors is an integer number (5770062177).
Almost surely, 211540124353 is an apocalyptic number.
It is an amenable number.
11540124353 is a deficient number, since it is larger than the sum of its proper divisors (1).
11540124353 is an equidigital number, since it uses as much as digits as its factorization.
11540124353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 11540124353 its reverse (35342104511), we get a palindrome (46882228864).
The spelling of 11540124353 in words is "eleven billion, five hundred forty million, one hundred twenty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.726 sec. • engine limits •