Base | Representation |
---|---|
bin | 1001101011111010100010… |
… | …00000110111011000100101 |
3 | 2210102021021201202012121122 |
4 | 10311331101000313120211 |
5 | 10242440102103032323 |
6 | 113145044244023325 |
7 | 4325611245504656 |
oct | 465752100673045 |
9 | 83367251665548 |
10 | 21300102002213 |
11 | 6872360318a81 |
12 | 2480129091b45 |
13 | bb678b5730c8 |
14 | 538d0519952d |
15 | 26e0e7c08ec8 |
hex | 135f51037625 |
21300102002213 has 2 divisors, whose sum is σ = 21300102002214. Its totient is φ = 21300102002212.
The previous prime is 21300102002141. The next prime is 21300102002273. The reversal of 21300102002213 is 31220020100312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13581745656964 + 7718356345249 = 3685342^2 + 2778193^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21300102002213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21300102002191 and 21300102002200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21300102002273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10650051001106 + 10650051001107.
It is an arithmetic number, because the mean of its divisors is an integer number (10650051001107).
Almost surely, 221300102002213 is an apocalyptic number.
It is an amenable number.
21300102002213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21300102002213 is an equidigital number, since it uses as much as digits as its factorization.
21300102002213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 21300102002213 its reverse (31220020100312), we get a palindrome (52520122102525).
The spelling of 21300102002213 in words is "twenty-one trillion, three hundred billion, one hundred two million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •