Base | Representation |
---|---|
bin | 10010001111110011… |
… | …01100100001100101 |
3 | 221021201100122000121 |
4 | 21013321230201211 |
5 | 130030314212014 |
6 | 4300023241541 |
7 | 464521451605 |
oct | 110771544145 |
9 | 27251318017 |
10 | 9796241509 |
11 | 41777a526a |
12 | 1a948a92b1 |
13 | c01718512 |
14 | 68d082c05 |
15 | 3c5060124 |
hex | 247e6c865 |
9796241509 has 2 divisors, whose sum is σ = 9796241510. Its totient is φ = 9796241508.
The previous prime is 9796241491. The next prime is 9796241569. The reversal of 9796241509 is 9051426979.
9796241509 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9543336100 + 252905409 = 97690^2 + 15903^2 .
It is a cyclic number.
It is not a de Polignac number, because 9796241509 - 227 = 9662023781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9796241569) 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, 4898120754 + 4898120755.
It is an arithmetic number, because the mean of its divisors is an integer number (4898120755).
Almost surely, 29796241509 is an apocalyptic number.
It is an amenable number.
9796241509 is a deficient number, since it is larger than the sum of its proper divisors (1).
9796241509 is an equidigital number, since it uses as much as digits as its factorization.
9796241509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1224720, while the sum is 52.
The square root of 9796241509 is about 98975.9642994197. The cubic root of 9796241509 is about 2139.7013521140.
The spelling of 9796241509 in words is "nine billion, seven hundred ninety-six million, two hundred forty-one thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •