Base | Representation |
---|---|
bin | 10101011100101111… |
… | …01001100111011101 |
3 | 1002201112012101220022 |
4 | 22232113221213131 |
5 | 142040413314244 |
6 | 5142354201525 |
7 | 555235013066 |
oct | 125627514735 |
9 | 32645171808 |
10 | 11515369949 |
11 | 497a142976 |
12 | 22945832a5 |
13 | 1116931595 |
14 | 7b350756d |
15 | 475e416ee |
hex | 2ae5e99dd |
11515369949 has 2 divisors, whose sum is σ = 11515369950. Its totient is φ = 11515369948.
The previous prime is 11515369927. The next prime is 11515369961. The reversal of 11515369949 is 94996351511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10250145049 + 1265224900 = 101243^2 + 35570^2 .
It is a cyclic number.
It is not a de Polignac number, because 11515369949 - 228 = 11246934493 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11515369949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11515369979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5757684974 + 5757684975.
It is an arithmetic number, because the mean of its divisors is an integer number (5757684975).
Almost surely, 211515369949 is an apocalyptic number.
It is an amenable number.
11515369949 is a deficient number, since it is larger than the sum of its proper divisors (1).
11515369949 is an equidigital number, since it uses as much as digits as its factorization.
11515369949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1312200, while the sum is 53.
The spelling of 11515369949 in words is "eleven billion, five hundred fifteen million, three hundred sixty-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.428 sec. • engine limits •