Base | Representation |
---|---|
bin | 10010011000111010001101… |
… | …011000001000001110000101 |
3 | 101121100201122201212122221002 |
4 | 102120322031120020032011 |
5 | 41100040242130040021 |
6 | 444002111103303045 |
7 | 23015066460030023 |
oct | 2230721530101605 |
9 | 347321581778832 |
10 | 80876606096261 |
11 | 23851637768898 |
12 | 90a25178aaa85 |
13 | 3618828a73621 |
14 | 15d863d033713 |
15 | 953bbd29850b |
hex | 498e8d608385 |
80876606096261 has 2 divisors, whose sum is σ = 80876606096262. Its totient is φ = 80876606096260.
The previous prime is 80876606096173. The next prime is 80876606096263. The reversal of 80876606096261 is 16269060667808.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78728531868100 + 2148074228161 = 8872910^2 + 1465631^2 .
It is a cyclic number.
It is not a de Polignac number, because 80876606096261 - 222 = 80876601901957 is a prime.
Together with 80876606096263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80876606096263) 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, 40438303048130 + 40438303048131.
It is an arithmetic number, because the mean of its divisors is an integer number (40438303048131).
Almost surely, 280876606096261 is an apocalyptic number.
It is an amenable number.
80876606096261 is a deficient number, since it is larger than the sum of its proper divisors (1).
80876606096261 is an equidigital number, since it uses as much as digits as its factorization.
80876606096261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62705664, while the sum is 65.
The spelling of 80876606096261 in words is "eighty trillion, eight hundred seventy-six billion, six hundred six million, ninety-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •