Base | Representation |
---|---|
bin | 10010001111110101011101… |
… | …111111011010001010000101 |
3 | 101112011010010101211000000210 |
4 | 102033311131333122022011 |
5 | 41004331211423012221 |
6 | 442403423223430033 |
7 | 22622043110513052 |
oct | 2217653577321205 |
9 | 345133111730023 |
10 | 80253040829061 |
11 | 2363113a3a0261 |
12 | 90016b0bb5319 |
13 | 35a1aa1bcc639 |
14 | 15b63a719a029 |
15 | 9428746ae276 |
hex | 48fd5dfda285 |
80253040829061 has 4 divisors (see below), whose sum is σ = 107004054438752. Its totient is φ = 53502027219372.
The previous prime is 80253040829029. The next prime is 80253040829077. The reversal of 80253040829061 is 16092804035208.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 80253040829061 - 25 = 80253040829029 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 80253040829061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80253040829011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13375506804841 + ... + 13375506804846.
It is an arithmetic number, because the mean of its divisors is an integer number (26751013609688).
Almost surely, 280253040829061 is an apocalyptic number.
It is an amenable number.
80253040829061 is a deficient number, since it is larger than the sum of its proper divisors (26751013609691).
80253040829061 is a wasteful number, since it uses less digits than its factorization.
80253040829061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26751013609690.
The product of its (nonzero) digits is 829440, while the sum is 48.
The spelling of 80253040829061 in words is "eighty trillion, two hundred fifty-three billion, forty million, eight hundred twenty-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •