Base | Representation |
---|---|
bin | 1001010010011111100011… |
… | …0011000111111011111011 |
3 | 1100011101100020021211111112 |
4 | 2110213320303013323323 |
5 | 2314313330210222021 |
6 | 33415532552550535 |
7 | 2102613243424436 |
oct | 224477063077373 |
9 | 40141306254445 |
10 | 10213311414011 |
11 | 328849403a622 |
12 | 118b4a93b244b |
13 | 59115a212524 |
14 | 27448108081d |
15 | 12aa11d2ed5b |
hex | 949f8cc7efb |
10213311414011 has 2 divisors, whose sum is σ = 10213311414012. Its totient is φ = 10213311414010.
The previous prime is 10213311413989. The next prime is 10213311414013. The reversal of 10213311414011 is 11041411331201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10213311414011 is a prime.
It is a super-3 number, since 3×102133114140113 (a number of 40 digits) contains 333 as substring.
Together with 10213311414013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10213311414013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106655707005 + 5106655707006.
It is an arithmetic number, because the mean of its divisors is an integer number (5106655707006).
Almost surely, 210213311414011 is an apocalyptic number.
10213311414011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10213311414011 is an equidigital number, since it uses as much as digits as its factorization.
10213311414011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 10213311414011 its reverse (11041411331201), we get a palindrome (21254722745212).
It can be divided in two parts, 1021331 and 1414011, that added together give a palindrome (2435342).
The spelling of 10213311414011 in words is "ten trillion, two hundred thirteen billion, three hundred eleven million, four hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •