Base | Representation |
---|---|
bin | 10010010100100100… |
… | …01110011101011101 |
3 | 221101111121001222101 |
4 | 21022102032131131 |
5 | 130121033221042 |
6 | 4304012245101 |
7 | 465515354614 |
oct | 111222163535 |
9 | 27344531871 |
10 | 9836226397 |
11 | 4198325528 |
12 | 1aa6170791 |
13 | c09aa820a |
14 | 6944d087b |
15 | 3c880c6b7 |
hex | 24a48e75d |
9836226397 has 2 divisors, whose sum is σ = 9836226398. Its totient is φ = 9836226396.
The previous prime is 9836226377. The next prime is 9836226427. The reversal of 9836226397 is 7936226389.
9836226397 is digitally balanced in base 2, because in such base 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., 8510247001 + 1325979396 = 92251^2 + 36414^2 .
It is a cyclic number.
It is not a de Polignac number, because 9836226397 - 27 = 9836226269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9836226347) 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, 4918113198 + 4918113199.
It is an arithmetic number, because the mean of its divisors is an integer number (4918113199).
Almost surely, 29836226397 is an apocalyptic number.
It is an amenable number.
9836226397 is a deficient number, since it is larger than the sum of its proper divisors (1).
9836226397 is an equidigital number, since it uses as much as digits as its factorization.
9836226397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5878656, while the sum is 55.
The square root of 9836226397 is about 99177.7515222038. The cubic root of 9836226397 is about 2142.6085752251.
The spelling of 9836226397 in words is "nine billion, eight hundred thirty-six million, two hundred twenty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •