Base | Representation |
---|---|
bin | 10010000001010110011101… |
… | …011000101001101000111101 |
3 | 101101121221220102202100000202 |
4 | 102001112131120221220331 |
5 | 40342024203012414023 |
6 | 440322245531133245 |
7 | 22460114666164235 |
oct | 2201263530515075 |
9 | 341557812670022 |
10 | 79257671998013 |
11 | 23287a98666123 |
12 | 8a80801ba4225 |
13 | 352bc74245172 |
14 | 158013dc44cc5 |
15 | 926a197e6128 |
hex | 48159d629a3d |
79257671998013 has 2 divisors, whose sum is σ = 79257671998014. Its totient is φ = 79257671998012.
The previous prime is 79257671998009. The next prime is 79257671998073. The reversal of 79257671998013 is 31089917675297.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71481309534244 + 7776362463769 = 8454662^2 + 2788613^2 .
It is a cyclic number.
It is not a de Polignac number, because 79257671998013 - 22 = 79257671998009 is a prime.
It is a super-2 number, since 2×792576719980132 (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 (79257671998073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 39628835999006 + 39628835999007.
It is an arithmetic number, because the mean of its divisors is an integer number (39628835999007).
Almost surely, 279257671998013 is an apocalyptic number.
It is an amenable number.
79257671998013 is a deficient number, since it is larger than the sum of its proper divisors (1).
79257671998013 is an equidigital number, since it uses as much as digits as its factorization.
79257671998013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 360067680, while the sum is 74.
The spelling of 79257671998013 in words is "seventy-nine trillion, two hundred fifty-seven billion, six hundred seventy-one million, nine hundred ninety-eight thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •