Base | Representation |
---|---|
bin | 10011100100010111… |
… | …010111100011010101 |
3 | 2000020022021120011111 |
4 | 103210113113203111 |
5 | 321012331401323 |
6 | 13352530535021 |
7 | 1342451153323 |
oct | 234427274325 |
9 | 60208246144 |
10 | 21011200213 |
11 | 8a02302783 |
12 | 40a4737471 |
13 | 1c9b036a63 |
14 | 103470ad13 |
15 | 82e910c0d |
hex | 4e45d78d5 |
21011200213 has 2 divisors, whose sum is σ = 21011200214. Its totient is φ = 21011200212.
The previous prime is 21011200207. The next prime is 21011200229. The reversal of 21011200213 is 31200211012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19110850564 + 1900349649 = 138242^2 + 43593^2 .
It is a cyclic number.
It is not a de Polignac number, because 21011200213 - 221 = 21009103061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21011200193 and 21011200202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21011200513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10505600106 + 10505600107.
It is an arithmetic number, because the mean of its divisors is an integer number (10505600107).
Almost surely, 221011200213 is an apocalyptic number.
It is an amenable number.
21011200213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21011200213 is an equidigital number, since it uses as much as digits as its factorization.
21011200213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 21011200213 its reverse (31200211012), we get a palindrome (52211411225).
The spelling of 21011200213 in words is "twenty-one billion, eleven million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •