Base | Representation |
---|---|
bin | 1001101001010011010001… |
… | …00100110110110111001101 |
3 | 2210002200111111002020122021 |
4 | 10310221220210312313031 |
5 | 10240002200032000023 |
6 | 113035513443450141 |
7 | 4316252036542561 |
oct | 464515044666715 |
9 | 83080444066567 |
10 | 21210303000013 |
11 | 683826a101576 |
12 | 2466847686951 |
13 | bab17a29734a |
14 | 534826c5d6a1 |
15 | 26bade33235d |
hex | 134a68936dcd |
21210303000013 has 2 divisors, whose sum is σ = 21210303000014. Its totient is φ = 21210303000012.
The previous prime is 21210302999981. The next prime is 21210303000077. The reversal of 21210303000013 is 31000030301212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12647966734404 + 8562336265609 = 3556398^2 + 2926147^2 .
It is a cyclic number.
It is not a de Polignac number, because 21210303000013 - 25 = 21210302999981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21210303009013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605151500006 + 10605151500007.
It is an arithmetic number, because the mean of its divisors is an integer number (10605151500007).
Almost surely, 221210303000013 is an apocalyptic number.
It is an amenable number.
21210303000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210303000013 is an equidigital number, since it uses as much as digits as its factorization.
21210303000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 21210303000013 its reverse (31000030301212), we get a palindrome (52210333301225).
The spelling of 21210303000013 in words is "twenty-one trillion, two hundred ten billion, three hundred three million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •