Base | Representation |
---|---|
bin | 1010010011100100000011… |
… | …0111100011100001111001 |
3 | 1111010020211122112012221012 |
4 | 2210321000313203201321 |
5 | 2441122310240011441 |
6 | 40033253102523305 |
7 | 2246436666045122 |
oct | 244710067434171 |
9 | 44106748465835 |
10 | 11331212032121 |
11 | 36795a3873983 |
12 | 1330093b96535 |
13 | 6426b4762a07 |
14 | 2b260daa5049 |
15 | 149b3e0a79eb |
hex | a4e40de3879 |
11331212032121 has 2 divisors, whose sum is σ = 11331212032122. Its totient is φ = 11331212032120.
The previous prime is 11331212032067. The next prime is 11331212032139. The reversal of 11331212032121 is 12123021213311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9160525476496 + 2170686555625 = 3026636^2 + 1473325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11331212032121 is a prime.
It is a super-2 number, since 2×113312120321212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11331212232121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665606016060 + 5665606016061.
It is an arithmetic number, because the mean of its divisors is an integer number (5665606016061).
Almost surely, 211331212032121 is an apocalyptic number.
It is an amenable number.
11331212032121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331212032121 is an equidigital number, since it uses as much as digits as its factorization.
11331212032121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11331212032121 its reverse (12123021213311), we get a palindrome (23454233245432).
The spelling of 11331212032121 in words is "eleven trillion, three hundred thirty-one billion, two hundred twelve million, thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •