Base | Representation |
---|---|
bin | 100101011000001110… |
… | …0011011111011010001 |
3 | 21200012010112000011101 |
4 | 1022300130123323101 |
5 | 2303343012441021 |
6 | 100513025144401 |
7 | 5541104550001 |
oct | 1126034337321 |
9 | 250163460141 |
10 | 80269655761 |
11 | 31051145489 |
12 | 1368218b101 |
13 | 7752c6a039 |
14 | 3c568d0001 |
15 | 214bed6a91 |
hex | 12b071bed1 |
80269655761 has 9 divisors (see below), whose sum is σ = 80576524443. Its totient is φ = 79963954560.
The previous prime is 80269655747. The next prime is 80269655789. The reversal of 80269655761 is 16755696208.
The square root of 80269655761 is 283319.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 49053833361 + 31215822400 = 221481^2 + 176680^2 .
It is a de Polignac number, because none of the positive numbers 2k-80269655761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (80269655731) 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 in 8 ways as a sum of consecutive naturals, for example, 127209916 + ... + 127210546.
Almost surely, 280269655761 is an apocalyptic number.
80269655761 is the 283319-th square number.
80269655761 is the 141660-th centered octagonal number.
It is an amenable number.
80269655761 is a deficient number, since it is larger than the sum of its proper divisors (306868682).
80269655761 is an frugal number, since it uses more digits than its factorization.
80269655761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2160 (or 1080 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 80269655761 in words is "eighty billion, two hundred sixty-nine million, six hundred fifty-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •