Base | Representation |
---|---|
bin | 1000000011101111111… |
… | …00000010001111001011 |
3 | 222110200221122011120211 |
4 | 10001313330002033023 |
5 | 14014032333232301 |
6 | 331111312301551 |
7 | 26001411205201 |
oct | 4016774021713 |
9 | 873627564524 |
10 | 276890133451 |
11 | a7479297538 |
12 | 457b5b418b7 |
13 | 20159083069 |
14 | d589c15071 |
15 | 73088eb051 |
hex | 4077f023cb |
276890133451 has 2 divisors, whose sum is σ = 276890133452. Its totient is φ = 276890133450.
The previous prime is 276890133427. The next prime is 276890133463. The reversal of 276890133451 is 154331098672.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 276890133451 - 225 = 276856579019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 276890133395 and 276890133404.
It is not a weakly prime, because it can be changed into another prime (276890133491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 138445066725 + 138445066726.
It is an arithmetic number, because the mean of its divisors is an integer number (138445066726).
It is a 1-persistent number, because it is pandigital, but 2⋅276890133451 = 553780266902 is not.
Almost surely, 2276890133451 is an apocalyptic number.
276890133451 is a deficient number, since it is larger than the sum of its proper divisors (1).
276890133451 is an equidigital number, since it uses as much as digits as its factorization.
276890133451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 49.
The spelling of 276890133451 in words is "two hundred seventy-six billion, eight hundred ninety million, one hundred thirty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •