Base | Representation |
---|---|
bin | 1001101001000000000110… |
… | …01011110110001000011011 |
3 | 2210001200221021202210021102 |
4 | 10310200003023312020123 |
5 | 10234320111033310021 |
6 | 113031052344102015 |
7 | 4315436026555352 |
oct | 464400313661033 |
9 | 83050837683242 |
10 | 21200012010011 |
11 | 683396910745a |
12 | 246485516490b |
13 | baa1ca215153 |
14 | 53412c1d0999 |
15 | 26b6dab4500b |
hex | 1348032f621b |
21200012010011 has 2 divisors, whose sum is σ = 21200012010012. Its totient is φ = 21200012010010.
The previous prime is 21200012009987. The next prime is 21200012010041. The reversal of 21200012010011 is 11001021000212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21200012010011 - 238 = 20925134103067 is a prime.
It is a super-2 number, since 2×212000120100112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21200012009974 and 21200012010001.
It is not a weakly prime, because it can be changed into another prime (21200012010041) 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, 10600006005005 + 10600006005006.
It is an arithmetic number, because the mean of its divisors is an integer number (10600006005006).
Almost surely, 221200012010011 is an apocalyptic number.
21200012010011 is a deficient number, since it is larger than the sum of its proper divisors (1).
21200012010011 is an equidigital number, since it uses as much as digits as its factorization.
21200012010011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21200012010011 its reverse (11001021000212), we get a palindrome (32201033010223).
The spelling of 21200012010011 in words is "twenty-one trillion, two hundred billion, twelve million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •