Base | Representation |
---|---|
bin | 10101011010111110… |
… | …00111110011110001 |
3 | 1002200111022112200111 |
4 | 22231133013303301 |
5 | 142023120121114 |
6 | 5141104421321 |
7 | 554665034254 |
oct | 125537076361 |
9 | 32614275614 |
10 | 11500551409 |
11 | 4971841546 |
12 | 228b617841 |
13 | 1113843709 |
14 | 7b156b09b |
15 | 4749b5bc4 |
hex | 2ad7c7cf1 |
11500551409 has 2 divisors, whose sum is σ = 11500551410. Its totient is φ = 11500551408.
The previous prime is 11500551371. The next prime is 11500551437. The reversal of 11500551409 is 90415500511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9303567025 + 2196984384 = 96455^2 + 46872^2 .
It is a cyclic number.
It is not a de Polignac number, because 11500551409 - 215 = 11500518641 is a prime.
It is a super-2 number, since 2×115005514092 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11500551449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5750275704 + 5750275705.
It is an arithmetic number, because the mean of its divisors is an integer number (5750275705).
Almost surely, 211500551409 is an apocalyptic number.
It is an amenable number.
11500551409 is a deficient number, since it is larger than the sum of its proper divisors (1).
11500551409 is an equidigital number, since it uses as much as digits as its factorization.
11500551409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 11500551409 in words is "eleven billion, five hundred million, five hundred fifty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •