Base | Representation |
---|---|
bin | 1010111001110010101001… |
… | …0111010001110011010001 |
3 | 1120110001000212002202022001 |
4 | 2232130222113101303101 |
5 | 3032402322400442213 |
6 | 41255110030514001 |
7 | 2345046635461132 |
oct | 256345227216321 |
9 | 46401025082261 |
10 | 11987964468433 |
11 | 39020814648a8 |
12 | 1417421065901 |
13 | 68c5ca097385 |
14 | 2d6313391c89 |
15 | 15bc7b4d21dd |
hex | ae72a5d1cd1 |
11987964468433 has 2 divisors, whose sum is σ = 11987964468434. Its totient is φ = 11987964468432.
The previous prime is 11987964468421. The next prime is 11987964468569. The reversal of 11987964468433 is 33486446978911.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9826676371009 + 2161288097424 = 3134753^2 + 1470132^2 .
It is a cyclic number.
It is not a de Polignac number, because 11987964468433 - 229 = 11987427597521 is a prime.
It is a super-2 number, since 2×119879644684332 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11987964462433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5993982234216 + 5993982234217.
It is an arithmetic number, because the mean of its divisors is an integer number (5993982234217).
Almost surely, 211987964468433 is an apocalyptic number.
It is an amenable number.
11987964468433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11987964468433 is an equidigital number, since it uses as much as digits as its factorization.
11987964468433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 752467968, while the sum is 73.
The spelling of 11987964468433 in words is "eleven trillion, nine hundred eighty-seven billion, nine hundred sixty-four million, four hundred sixty-eight thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •