Base | Representation |
---|---|
bin | 10010010111100011000110… |
… | …011111011011010011101001 |
3 | 101121000210020101200012212002 |
4 | 102113203012133123103221 |
5 | 41042022214201431444 |
6 | 443451122104100345 |
7 | 23005245623055254 |
oct | 2227430637332351 |
9 | 347023211605762 |
10 | 80783075030249 |
11 | 23815a00931629 |
12 | 90883744646b5 |
13 | 360ca71528797 |
14 | 15d3cc91ac09b |
15 | 951546e24d4e |
hex | 4978c67db4e9 |
80783075030249 has 2 divisors, whose sum is σ = 80783075030250. Its totient is φ = 80783075030248.
The previous prime is 80783075030243. The next prime is 80783075030261. The reversal of 80783075030249 is 94203057038708.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64509168697600 + 16273906332649 = 8031760^2 + 4034093^2 .
It is a cyclic number.
It is not a de Polignac number, because 80783075030249 - 24 = 80783075030233 is a prime.
It is a super-2 number, since 2×807830750302492 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80783075030194 and 80783075030203.
It is not a weakly prime, because it can be changed into another prime (80783075030243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40391537515124 + 40391537515125.
It is an arithmetic number, because the mean of its divisors is an integer number (40391537515125).
Almost surely, 280783075030249 is an apocalyptic number.
It is an amenable number.
80783075030249 is a deficient number, since it is larger than the sum of its proper divisors (1).
80783075030249 is an equidigital number, since it uses as much as digits as its factorization.
80783075030249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10160640, while the sum is 56.
The spelling of 80783075030249 in words is "eighty trillion, seven hundred eighty-three billion, seventy-five million, thirty thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •