Base | Representation |
---|---|
bin | 10010001111110100101110… |
… | …001001110011000101111101 |
3 | 101112011001001110121120102012 |
4 | 102033310232021303011331 |
5 | 41004323040442340034 |
6 | 442403211433341005 |
7 | 22622014163621405 |
oct | 2217645611630575 |
9 | 345131043546365 |
10 | 80252238246269 |
11 | 236308683559a1 |
12 | 9001508267765 |
13 | 35a19a4853c8b |
14 | 15b632c75b805 |
15 | 942828ec6cce |
hex | 48fd2e27317d |
80252238246269 has 2 divisors, whose sum is σ = 80252238246270. Its totient is φ = 80252238246268.
The previous prime is 80252238246209. The next prime is 80252238246283. The reversal of 80252238246269 is 96264283225208.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69242868712900 + 11009369533369 = 8321230^2 + 3318037^2 .
It is a cyclic number.
It is not a de Polignac number, because 80252238246269 - 28 = 80252238246013 is a prime.
It is a super-2 number, since 2×802522382462692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80252238246209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40126119123134 + 40126119123135.
It is an arithmetic number, because the mean of its divisors is an integer number (40126119123135).
Almost surely, 280252238246269 is an apocalyptic number.
It is an amenable number.
80252238246269 is a deficient number, since it is larger than the sum of its proper divisors (1).
80252238246269 is an equidigital number, since it uses as much as digits as its factorization.
80252238246269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 39813120, while the sum is 59.
The spelling of 80252238246269 in words is "eighty trillion, two hundred fifty-two billion, two hundred thirty-eight million, two hundred forty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •