Base | Representation |
---|---|
bin | 1010010001001101100001… |
… | …0110111000011110001101 |
3 | 1110222101112112112222222011 |
4 | 2210103120112320132031 |
5 | 2434442031301243041 |
6 | 40002531305021221 |
7 | 2243506434622156 |
oct | 244233026703615 |
9 | 43871475488864 |
10 | 11290803931021 |
11 | 36634485174aa |
12 | 1324297484811 |
13 | 63b944c93714 |
14 | 2b069922492d |
15 | 148a7685be81 |
hex | a44d85b878d |
11290803931021 has 2 divisors, whose sum is σ = 11290803931022. Its totient is φ = 11290803931020.
The previous prime is 11290803930961. The next prime is 11290803931087. The reversal of 11290803931021 is 12013930809211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11239993812100 + 50810118921 = 3352610^2 + 225411^2 .
It is an emirp because it is prime and its reverse (12013930809211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11290803931021 - 27 = 11290803930893 is a prime.
It is a super-2 number, since 2×112908039310212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11290803901021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5645401965510 + 5645401965511.
It is an arithmetic number, because the mean of its divisors is an integer number (5645401965511).
Almost surely, 211290803931021 is an apocalyptic number.
It is an amenable number.
11290803931021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11290803931021 is an equidigital number, since it uses as much as digits as its factorization.
11290803931021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 40.
The spelling of 11290803931021 in words is "eleven trillion, two hundred ninety billion, eight hundred three million, nine hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •