Base | Representation |
---|---|
bin | 10100010110010001… |
… | …11000101100000001 |
3 | 1001012022222210012011 |
4 | 22023020320230001 |
5 | 134333110000321 |
6 | 5004001332521 |
7 | 534466664164 |
oct | 121310705401 |
9 | 31168883164 |
10 | 10924296961 |
11 | 46a6531aa6 |
12 | 214a637141 |
13 | 1051340056 |
14 | 758c05adb |
15 | 43e0d8ae1 |
hex | 28b238b01 |
10924296961 has 2 divisors, whose sum is σ = 10924296962. Its totient is φ = 10924296960.
The previous prime is 10924296949. The next prime is 10924296967. The reversal of 10924296961 is 16969242901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5782689936 + 5141607025 = 76044^2 + 71705^2 .
It is a cyclic number.
It is not a de Polignac number, because 10924296961 - 27 = 10924296833 is a prime.
It is a super-2 number, since 2×109242969612 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10924296967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5462148480 + 5462148481.
It is an arithmetic number, because the mean of its divisors is an integer number (5462148481).
Almost surely, 210924296961 is an apocalyptic number.
It is an amenable number.
10924296961 is a deficient number, since it is larger than the sum of its proper divisors (1).
10924296961 is an equidigital number, since it uses as much as digits as its factorization.
10924296961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 419904, while the sum is 49.
The spelling of 10924296961 in words is "ten billion, nine hundred twenty-four million, two hundred ninety-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •