Base | Representation |
---|---|
bin | 10010001100111011011001… |
… | …010010111001000111011101 |
3 | 101111110000102100201200220100 |
4 | 102030323121102321013131 |
5 | 40443043021443240021 |
6 | 442131541544411313 |
7 | 22601441031215601 |
oct | 2214733122710735 |
9 | 344400370650810 |
10 | 80053246071261 |
11 | 23564433472611 |
12 | 8b8aa32176b39 |
13 | 3588cb1281868 |
14 | 15aa852463501 |
15 | 93c57e27c626 |
hex | 48ced94b91dd |
80053246071261 has 12 divisors (see below), whose sum is σ = 115634961971100. Its totient is φ = 53367678980160.
The previous prime is 80053246071223. The next prime is 80053246071287. The reversal of 80053246071261 is 16217064235008.
80053246071261 is a `hidden beast` number, since 8 + 0 + 0 + 5 + 3 + 24 + 607 + 12 + 6 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 6007548060900 + 74045698010361 = 2451030^2 + 8604981^2 .
It is not a de Polignac number, because 80053246071261 - 211 = 80053246069213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80053246071361) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 95537520 + ... + 96371801.
It is an arithmetic number, because the mean of its divisors is an integer number (9636246830925).
Almost surely, 280053246071261 is an apocalyptic number.
It is an amenable number.
80053246071261 is a deficient number, since it is larger than the sum of its proper divisors (35581715899839).
80053246071261 is a wasteful number, since it uses less digits than its factorization.
80053246071261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191955676 (or 191955673 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 80053246071261 in words is "eighty trillion, fifty-three billion, two hundred forty-six million, seventy-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •