Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101101010100111101 |
3 | 1111010020122000200020001011 |
4 | 2210320330003231110331 |
5 | 2441122124110110101 |
6 | 40033241101115221 |
7 | 2246434666104403 |
oct | 244707403552475 |
9 | 44106560606034 |
10 | 11331131331901 |
11 | 3679562264687 |
12 | 1330070b58b11 |
13 | 6426a0b189c4 |
14 | 2b2603099473 |
15 | 149b36e66751 |
hex | a4e3c0ed53d |
11331131331901 has 2 divisors, whose sum is σ = 11331131331902. Its totient is φ = 11331131331900.
The previous prime is 11331131331899. The next prime is 11331131331991. The reversal of 11331131331901 is 10913313113311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7184002729401 + 4147128602500 = 2680299^2 + 2036450^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331131331901 - 21 = 11331131331899 is a prime.
Together with 11331131331899, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331131331991) 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, 5665565665950 + 5665565665951.
It is an arithmetic number, because the mean of its divisors is an integer number (5665565665951).
Almost surely, 211331131331901 is an apocalyptic number.
It is an amenable number.
11331131331901 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331131331901 is an equidigital number, since it uses as much as digits as its factorization.
11331131331901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2187, while the sum is 31.
The spelling of 11331131331901 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred thirty-one thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.282 sec. • engine limits •