Base | Representation |
---|---|
bin | 1000000011101111111… |
… | …00000010001110100001 |
3 | 222110200221122011112021 |
4 | 10001313330002032201 |
5 | 14014032333232114 |
6 | 331111312301441 |
7 | 26001411205111 |
oct | 4016774021641 |
9 | 873627564467 |
10 | 276890133409 |
11 | a74792974aa |
12 | 457b5b41881 |
13 | 20159083036 |
14 | d589c15041 |
15 | 73088eb024 |
hex | 4077f023a1 |
276890133409 has 2 divisors, whose sum is σ = 276890133410. Its totient is φ = 276890133408.
The previous prime is 276890133391. The next prime is 276890133427. The reversal of 276890133409 is 904331098672.
It is a balanced prime because it is at equal distance from previous prime (276890133391) and next prime (276890133427).
It can be written as a sum of positive squares in only one way, i.e., 228006250000 + 48883883409 = 477500^2 + 221097^2 .
It is a cyclic number.
It is not a de Polignac number, because 276890133409 - 211 = 276890131361 is a prime.
It is a super-2 number, since 2×2768901334092 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (276890173409) 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, 138445066704 + 138445066705.
It is an arithmetic number, because the mean of its divisors is an integer number (138445066705).
Almost surely, 2276890133409 is an apocalyptic number.
It is an amenable number.
276890133409 is a deficient number, since it is larger than the sum of its proper divisors (1).
276890133409 is an equidigital number, since it uses as much as digits as its factorization.
276890133409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1959552, while the sum is 52.
The spelling of 276890133409 in words is "two hundred seventy-six billion, eight hundred ninety million, one hundred thirty-three thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •