Base | Representation |
---|---|
bin | 10010000100011100… |
… | …01110101010111101 |
3 | 221001002001212200021 |
4 | 21002032032222331 |
5 | 124331421222312 |
6 | 4242341132141 |
7 | 462253544002 |
oct | 110216165275 |
9 | 27032055607 |
10 | 9700960957 |
11 | 4128a37606 |
12 | 1a689ba051 |
13 | bb7a67bac |
14 | 68055d8a9 |
15 | 3bb9ddc07 |
hex | 24238eabd |
9700960957 has 2 divisors, whose sum is σ = 9700960958. Its totient is φ = 9700960956.
The previous prime is 9700960931. The next prime is 9700960991. The reversal of 9700960957 is 7590690079.
9700960957 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., 8053088121 + 1647872836 = 89739^2 + 40594^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9700960957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9700960457) 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, 4850480478 + 4850480479.
It is an arithmetic number, because the mean of its divisors is an integer number (4850480479).
Almost surely, 29700960957 is an apocalyptic number.
It is an amenable number.
9700960957 is a deficient number, since it is larger than the sum of its proper divisors (1).
9700960957 is an equidigital number, since it uses as much as digits as its factorization.
9700960957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1071630, while the sum is 52.
The square root of 9700960957 is about 98493.4564171651. The cubic root of 9700960957 is about 2132.7416594811.
The spelling of 9700960957 in words is "nine billion, seven hundred million, nine hundred sixty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •