Base | Representation |
---|---|
bin | 1010010010010101001010… |
… | …0001001001010100101101 |
3 | 1111001020011200000201022102 |
4 | 2210211102201021110231 |
5 | 2440300422011423041 |
6 | 40015431345224445 |
7 | 2245060111636424 |
oct | 244452241112455 |
9 | 44036150021272 |
10 | 11310033311021 |
11 | 3670615a52295 |
12 | 1327b63332125 |
13 | 6406bab04193 |
14 | 2b15a102c2bb |
15 | 1492eeb0609b |
hex | a495284952d |
11310033311021 has 2 divisors, whose sum is σ = 11310033311022. Its totient is φ = 11310033311020.
The previous prime is 11310033311011. The next prime is 11310033311039. The reversal of 11310033311021 is 12011333001311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11040428325796 + 269604985225 = 3322714^2 + 519235^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11310033311021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11310033310984 and 11310033311002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11310033311011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655016655510 + 5655016655511.
It is an arithmetic number, because the mean of its divisors is an integer number (5655016655511).
Almost surely, 211310033311021 is an apocalyptic number.
It is an amenable number.
11310033311021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11310033311021 is an equidigital number, since it uses as much as digits as its factorization.
11310033311021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 11310033311021 its reverse (12011333001311), we get a palindrome (23321366312332).
The spelling of 11310033311021 in words is "eleven trillion, three hundred ten billion, thirty-three million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •