Base | Representation |
---|---|
bin | 10111001100101110101… |
… | …10000010000011011111 |
3 | 2211012110211111020100011 |
4 | 23212113112002003133 |
5 | 101024434132204314 |
6 | 1410104132344051 |
7 | 111406036633564 |
oct | 13462726020337 |
9 | 2735424436304 |
10 | 797108084959 |
11 | 28806280816a |
12 | 10a599a75027 |
13 | 5a222aa9944 |
14 | 2a81a25686b |
15 | 15b0449d4c4 |
hex | b9975820df |
797108084959 has 4 divisors (see below), whose sum is σ = 802457803800. Its totient is φ = 791758366120.
The previous prime is 797108084917. The next prime is 797108085013. The reversal of 797108084959 is 959480801797.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-797108084959 is a prime.
It is a Smith number, since the sum of its digits (67) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 797108084894 and 797108084903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (797108082959) 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, 2674859197 + ... + 2674859494.
It is an arithmetic number, because the mean of its divisors is an integer number (200614450950).
Almost surely, 2797108084959 is an apocalyptic number.
797108084959 is a deficient number, since it is larger than the sum of its proper divisors (5349718841).
797108084959 is a wasteful number, since it uses less digits than its factorization.
797108084959 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5349718840.
The product of its (nonzero) digits is 45722880, while the sum is 67.
The spelling of 797108084959 in words is "seven hundred ninety-seven billion, one hundred eight million, eighty-four thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •