Base | Representation |
---|---|
bin | 10010001111111011… |
… | …00001100000101011 |
3 | 221021210020121111212 |
4 | 21013331201200223 |
5 | 130031043314341 |
6 | 4300100543335 |
7 | 464533131263 |
oct | 110775414053 |
9 | 27253217455 |
10 | 9797244971 |
11 | 4178320178 |
12 | 1a950b1b4b |
13 | c019aa197 |
14 | 68d2647a3 |
15 | 3c51ac5eb |
hex | 247f6182b |
9797244971 has 2 divisors, whose sum is σ = 9797244972. Its totient is φ = 9797244970.
The previous prime is 9797244943. The next prime is 9797244973. The reversal of 9797244971 is 1794427979.
9797244971 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 9797244971 - 210 = 9797243947 is a prime.
Together with 9797244973, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 9797244971.
It is not a weakly prime, because it can be changed into another prime (9797244973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4898622485 + 4898622486.
It is an arithmetic number, because the mean of its divisors is an integer number (4898622486).
Almost surely, 29797244971 is an apocalyptic number.
9797244971 is a deficient number, since it is larger than the sum of its proper divisors (1).
9797244971 is an equidigital number, since it uses as much as digits as its factorization.
9797244971 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8001504, while the sum is 59.
The square root of 9797244971 is about 98981.0333902410. The cubic root of 9797244971 is about 2139.7744085574.
The spelling of 9797244971 in words is "nine billion, seven hundred ninety-seven million, two hundred forty-four thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •