Base | Representation |
---|---|
bin | 10110010010001001… |
… | …10110000010111111 |
3 | 1010212202021221211022 |
4 | 23021010312002333 |
5 | 144000114044314 |
6 | 5255041414355 |
7 | 602315301653 |
oct | 131104660277 |
9 | 33782257738 |
10 | 11963424959 |
11 | 508a050272 |
12 | 239a63a3bb |
13 | 11886c9ba5 |
14 | 816c1aa63 |
15 | 4a044878e |
hex | 2c91360bf |
11963424959 has 2 divisors, whose sum is σ = 11963424960. Its totient is φ = 11963424958.
The previous prime is 11963424937. The next prime is 11963424983. The reversal of 11963424959 is 95942436911.
11963424959 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 is a cyclic number.
It is not a de Polignac number, because 11963424959 - 28 = 11963424703 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11963424959.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11963424919) 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, 5981712479 + 5981712480.
It is an arithmetic number, because the mean of its divisors is an integer number (5981712480).
Almost surely, 211963424959 is an apocalyptic number.
11963424959 is a deficient number, since it is larger than the sum of its proper divisors (1).
11963424959 is an equidigital number, since it uses as much as digits as its factorization.
11963424959 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2099520, while the sum is 53.
The spelling of 11963424959 in words is "eleven billion, nine hundred sixty-three million, four hundred twenty-four thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •