Base | Representation |
---|---|
bin | 1010011001011000111101… |
… | …0101001011001110110001 |
3 | 1111110211012211112101001201 |
4 | 2212112033111023032301 |
5 | 2444242312020330234 |
6 | 40151250022531201 |
7 | 2256612404313334 |
oct | 246261725131661 |
9 | 44424184471051 |
10 | 11431312667569 |
11 | 3707aa0a94973 |
12 | 134756b596b01 |
13 | 64bc78079252 |
14 | 2b73c824061b |
15 | 14c54c070314 |
hex | a658f54b3b1 |
11431312667569 has 2 divisors, whose sum is σ = 11431312667570. Its totient is φ = 11431312667568.
The previous prime is 11431312667447. The next prime is 11431312667591. The reversal of 11431312667569 is 96576621313411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7649162866944 + 3782149800625 = 2765712^2 + 1944775^2 .
It is a cyclic number.
It is not a de Polignac number, because 11431312667569 - 233 = 11422722732977 is a prime.
It is a super-2 number, since 2×114313126675692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11431312665569) 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, 5715656333784 + 5715656333785.
It is an arithmetic number, because the mean of its divisors is an integer number (5715656333785).
Almost surely, 211431312667569 is an apocalyptic number.
It is an amenable number.
11431312667569 is a deficient number, since it is larger than the sum of its proper divisors (1).
11431312667569 is an equidigital number, since it uses as much as digits as its factorization.
11431312667569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4898880, while the sum is 55.
The spelling of 11431312667569 in words is "eleven trillion, four hundred thirty-one billion, three hundred twelve million, six hundred sixty-seven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •